Loading...
Searching...
No Matches
sorter.h
Go to the documentation of this file.
153 /* everything is greater or equal than the pivot element: move pivot to the left (degenerate case) */
257 /* we assume that range {start, ..., start2-1} already contains the start2-start smallest elements in sorted order;
336 /* everything is greater or equal than the pivot element: move pivot to the left (degenerate case) */
354 /* everything is greater or equal than the pivot element: move pivot to the left (degenerate case) */
377 /* otherwise, and if we do not need to sort the ">" part, use standard quicksort on the "<" part */
Everything should be within this namespace. void SPxShellsort(T *keys, int end, COMPARATOR &compare, int start=0) Definition sorter.h:39 int SPxQuicksortPart(T *keys, COMPARATOR &compare, int start, int end, int size, int start2=0, int end2=0, bool type=true) Generic implementation of Partial QuickSort. Definition sorter.h:246 void SPxQuicksort(T *keys, int end, COMPARATOR &compare, int start=0, bool type=true) Generic QuickSort implementation. Definition sorter.h:82
|