| 
 | ||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectcom.icl.saxon.sort.QuickSort
This is a generic version of C.A.R Hoare's Quick Sort algorithm. This will handle arrays that are already sorted, and arrays with duplicate keys.
| Constructor Summary | |
| QuickSort() | |
| Method Summary | |
| static void | sort(Sortable a,
     int lo0,
     int hi0)This is a generic version of C.A.R Hoare's Quick Sort algorithm. | 
| Methods inherited from class java.lang.Object | 
| clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait | 
| Constructor Detail | 
public QuickSort()
| Method Detail | 
public static void sort(Sortable a,
                        int lo0,
                        int hi0)
a - a Sortable objectlo0 - index of first element (initially typically 0)hi0 - index of last element (initially typically length-1)| 
 | ||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||