![]() |
ScalES-PPM
|
perform insertion sort on array More...
Functions | |
void | PPM_insertion_sort (void *a, size_t n, size_t es, void *data, PPM_CompareWithData cmp) |
perform insertion sort on array a | |
void | PPM_sorted_insertion (void *a, size_t n, size_t es, void *data, PPM_CompareWithData cmp) |
perform insertion of element a[n] into partially sorted array a, i.e where elements 0 up to n - 1 are already in sort order | |
void | PPM_insertion_sort_once (void *a, size_t n, size_t es, size_t inversion, void *data, PPM_CompareWithData cmp) |
Perform sort on element a[inversion] only. | |
perform insertion sort on array
void PPM_insertion_sort | ( | void * | a, |
size_t | n, | ||
size_t | es, | ||
void * | data, | ||
PPM_CompareWithData | cmp ) |
perform insertion sort on array a
a | array to sort |
n | number of elements in a |
es | size of element of a in bytes |
data | optional extra information to use in comparison |
cmp | comparison function |
void PPM_insertion_sort_once | ( | void * | a, |
size_t | n, | ||
size_t | es, | ||
size_t | inversion, | ||
void * | data, | ||
PPM_CompareWithData | cmp ) |
Perform sort on element a[inversion] only.
It is assumed, that a[0..inversion-1,inversion+1..n-1] forms an already sorted array, into which the misplaced element at index inversion needs to be integrated.
a | array to insert into |
n | number of elements in a |
es | size of element of a in bytes |
inversion | position of element not in sort order |
data | optional extra information to use in comparison |
cmp | comparison function |
void PPM_sorted_insertion | ( | void * | a, |
size_t | n, | ||
size_t | es, | ||
void * | data, | ||
PPM_CompareWithData | cmp ) |
perform insertion of element a[n] into partially sorted array a, i.e where elements 0 up to n - 1 are already in sort order
This is a special case of PPM_insertion_sort_once where inversion is equal to n-1.
a | array to insert into |
n | number of elements in a |
es | size of element of a in bytes |
data | optional extra information to use in comparison |
cmp | comparison function |
Das diesem Bericht zugrundeliegende Vorhaben wurde mit Mitteln des Bundesministeriums für Bildung, und Forschung unter dem Förderkennzeichen 01IH08004E gefördert. Die Verantwortung für den Inhalt dieser Veröffentlichung liegt beim Autor.