Has routines for sorting an ivector. More...
Go to the source code of this file.
Defines | |
#define | int_lt(a, b) ((*a)<(*b)) |
#define | int_lt(a, b) ((*a)<(*b)) |
Functions | |
void | int_qsort (int *arr, unsigned n) |
A subroutine used in Quicksort. | |
void | int_qsort2 (int *arr, int *arr2, unsigned n) |
A subroutine used in Quicksort. | |
ivector | sort (const ivector &v, int NSTACK) |
Quicksort. | |
ivector | sort (const ivector &_v, const ivector &_index, int NSTACK) |
Quicksort. |
Has routines for sorting an ivector.
Definition in file ivsort.cpp.
#define int_lt | ( | a, | |
b | |||
) | ((*a)<(*b)) |
Referenced by int_qsort(), and int_qsort2().
#define int_lt | ( | a, | |
b | |||
) | ((*a)<(*b)) |
void int_qsort | ( | int * | arr, |
unsigned | n | ||
) |
void int_qsort2 | ( | int * | arr, |
int * | arr2, | ||
unsigned | n | ||
) |
Quicksort.
v | Vector of integers to be sorted |
NSTACK | Not used. |
Adopted from the GNU C Library. http://www.corpit.ru/mjt/qsort.html
Definition at line 40 of file ivsort.cpp.
Quicksort.
_v | Vector of integers to be sorted |
_index | ivector on return containing the input order of the original vector. |
NSTACK | Not used. |
Adopted from the GNU C Library. http://www.corpit.ru/mjt/qsort.html
Definition at line 74 of file ivsort.cpp.
Generated on Tue Mar 8 2016 19:51:37 for ADMB Documentation by 1.8.0 |