template<class Type>
| void Impala::Util::QuickSortDesc | ( | Type * | data, | |
| int | left, | |||
| int | right | |||
| ) |
- Note:
- right is inclusive
Definition at line 131 of file QuickSort.h.
References cQuicksortTreshold, PartitionDesc(), and SelectionSortDesc().
00132 { 00133 if(left < (right-cQuicksortTreshold)) 00134 { 00135 int split_pt = PartitionDesc(data,left, right); 00136 QuickSortDesc(data, left, split_pt); 00137 QuickSortDesc(data, split_pt+1, right); 00138 } 00139 else 00140 SelectionSortDesc(data, left, right); 00141 }
Here is the call graph for this function:
