|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectorg.apache.hadoop.util.QuickSort
public final class QuickSort
An implementation of the core algorithm of QuickSort.
| Constructor Summary | |
|---|---|
QuickSort()
|
|
| Method Summary | |
|---|---|
protected static int |
getMaxDepth(int x)
Deepest recursion before giving up and doing a heapsort. |
void |
sort(IndexedSortable s,
int p,
int r)
Sort the given range of items using quick sort. |
void |
sort(IndexedSortable s,
int p,
int r,
Progressable rep)
Same as IndexedSorter.sort(IndexedSortable,int,int), but indicate progress
periodically. |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
|---|
public QuickSort()
| Method Detail |
|---|
protected static int getMaxDepth(int x)
public void sort(IndexedSortable s,
int p,
int r)
getMaxDepth(int),
then switch to HeapSort.
sort in interface IndexedSorterIndexedSortable.compare(int, int),
IndexedSortable.swap(int, int)
public void sort(IndexedSortable s,
int p,
int r,
Progressable rep)
IndexedSorter.sort(IndexedSortable,int,int), but indicate progress
periodically.
sort in interface IndexedSorterIndexedSorter.sort(IndexedSortable,int,int)
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||