Searched defs:pivot (Results 1 - 1 of 1) sorted by relevance
| /openjdk7/hotspot/src/share/vm/utilities/ |
| H A D | quickSort.hpp | 42 // As pivot we use the median of the first, last and middle elements.
44 // means that this method not only returns the index of the pivot
65 // of the fist, last and middle values. Use this as pivot.
70 static int partition(T* array, int pivot, int length, C comparator) { argument
73 T pivot_val = array[pivot];
101 int pivot = find_pivot(array, length, comparator); local
103 // arrays up to length 3 will be sorted after finding the pivot
106 int split = partition<T, C, idempotent>(array, pivot, length, comparator);
|
Completed in 29 milliseconds