Go to the source code of this file.
Functions | |
| int | issort (void *donnee, int nb_elts, int taille_elt, int(*compare)(const void *cle1, const void *cle2)) |
| Sort data using the insertion method. | |
| int | extended_issort (void *donnee, int nb_elts, int taille_elt, int(*compare)(const void *cle1, const void *cle2), int(*copy_data)(void *src, void *dest), int(*init_elem)(void *elm)) |
| Extended version of the function issort(). This can be used to handle complex data. | |
| int | qksort (void *donnee, int nb_elts, int taille_elt, int i, int k, int(*compare)(const void *cle1, const void *cle2)) |
| Sort data using the QuickSort algorithm. | |
| int | extended_qksort (void *donnee, int nb_elts, int taille_elt, int i, int k, int(*compare)(const void *cle1, const void *cle2), int(*copy_data)(void *src, void *dest), int(*init_elem)(void *elm)) |
| Sort data using the QuickSort algorithm. | |
Definition in file sort.h.
|
||||||||||||||||||||||||||||
|
Extended version of the function issort(). This can be used to handle complex data.
|
|
||||||||||||||||||||||||||||||||||||
|
Sort data using the QuickSort algorithm.
|
|
||||||||||||||||||||
|
Sort data using the insertion method.
Definition at line 34 of file issort.c. Referenced by array_rem_all(). |
|
||||||||||||||||||||||||||||
|
Sort data using the QuickSort algorithm.
|
1.3-rc1