Searched refs:quicksort (Results 1 - 1 of 1) sorted by relevance
| /external/replicaisland/src/com/replica/replicaisland/ |
| H A D | QuickSorter.java | 23 quicksort(array, 0, count - 1, comparator);
30 * Generate N random real numbers between 0 and 1 and quicksort them.
32 * On average, this quicksort algorithm runs in time proportional to
44 // quicksort a[left] to a[right]
45 public void quicksort(Type[] a, int left, int right, Comparator<Type> comparator) { method in class:QuickSorter
48 quicksort(a, left, i - 1, comparator);
49 quicksort(a, i + 1, right, comparator);
|
Completed in 45 milliseconds