51 while (value[index[i]] <
pivot) i++;
52 while (value[index[j]] >
pivot) j--;
61 if(low < j)
quicksort(value, index, low, j);
69 template<
typename Treal,
typename Tfun>
71 throw(std::exception){
77 while (
fun.value(index[i]) <
pivot) i++;
78 while (
fun.value(index[j]) >
pivot) j--;
99 while (value[index[i]] <
pivot) i++;
100 while (value[index[j]] >
pivot) j--;
109 if(low < j)
quicksort(value, index, low, j);
Definition allocate.cc:39
void quicksort(const Treal *value, int *index, int low, int high)
Definition sort.h:42
static Treal getMachineEpsilon()
Definition matInclude.h:147