template<class Type>
| void Impala::Util::QuickSort | ( | Type * | data, | |
| int | left, | |||
| int | right | |||
| ) |
- Note:
- right is inclusive
Definition at line 67 of file QuickSort.h.
References cQuicksortTreshold, Partition(), and SelectionSort().
Referenced by Impala::Core::Table::AnnotationTable::Sort(), Impala::Core::Array::Sort(), and Impala::Core::Table::QuidTable::UpdateGroups().
00068 { 00069 if(left < (right-cQuicksortTreshold)) 00070 { 00071 int split_pt = Partition(data,left, right); 00072 QuickSort(data, left, split_pt); 00073 QuickSort(data, split_pt+1, right); 00074 } 00075 else 00076 SelectionSort(data, left, right); 00077 }
Here is the call graph for this function:
