SoPlex
|
Generic QuickSort implementation. More...
#include <assert.h>
Go to the source code of this file.
Namespaces | |
namespace | soplex |
Everything should be within this namespace. | |
Macros | |
#define | SOPLEX_SHELLSORTMAX 25 |
Functions | |
template<class T, class COMPARATOR> | |
void | SPxShellsort (T *keys, int end, COMPARATOR &compare, int start=0) |
template<class T, class COMPARATOR> | |
void | SPxQuicksort (T *keys, int end, COMPARATOR &compare, int start=0, bool type=true) |
Generic QuickSort implementation. | |
template<class T, class COMPARATOR> | |
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. | |
Generic QuickSort implementation.
Definition in file sorter.h.
#define SOPLEX_SHELLSORTMAX 25 |
Definition at line 35 of file sorter.h.
Referenced by soplex::SPxQuicksort().