ADMB Documentation
-a65f1c97
|
Functions | |
dvector | sort (const dvector &v, int NSTACK) |
Quicksort. More... | |
ivector | sort (const ivector &v, int NSTACK) |
Quicksort. More... | |
ivector | sort (const ivector &_v, const ivector &_index, int NSTACK) |
Quicksort. More... | |
dvector | sort (const dvector &_v, const ivector &_index, int NSTACK) |
Quicksort. More... | |
Quicksort.
v | Vector of doubles to be sorted |
NSTACK | Lenth of intermediate storage vector. Default is NSTACK = 60. |
The implementation of this algorithm was inspired by "Numerical Recipes in C", 2nd edition, Press, Teukolsky, Vetterling, Flannery, chapter 8
Definition at line 20 of file dvsort2.cpp.
Quicksort.
v | Vector of integers to be sorted |
NSTACK | Lenth of intermediate storage vector. Default is NSTACK = 60. |
The implementation of this algorithm was inspired by "Numerical Recipes in C", 2nd edition, Press, Teukolsky, Vetterling, Flannery, chapter 8
Definition at line 20 of file ivsort2.cpp.
Quicksort.
_v | Vector of integers to be sorted |
_index | ivector on return containing the input order of the origian vector. |
NSTACK | Lenth of intermediate storage vector. Default is NSTACK = 60. |
The implementation of this algorithm was inspired by "Numerical Recipes in C", 2nd edition, Press, Teukolsky, Vetterling, Flannery, chapter 8
Definition at line 110 of file ivsort2.cpp.
Quicksort.
_v | Vector to be sorted |
_index | ivector on return containing the input order of the origian vector. |
NSTACK | Lenth of intermediate storage vector. Default is NSTACK = 60. |
The implementation of this algorithm was inspired by "Numerical Recipes in C", 2nd edition, Press, Teukolsky, Vetterling, Flannery, chapter 8
Definition at line 114 of file dvsort2.cpp.
Generated on Wed Sep 7 2022 00:01:35 for ADMB Documentation by 1.8.5 |