| Méthode | Description | |
|---|---|---|
| FastQuickSorter ( ) : System | ||
| FastQuickSorter ( IComparer comparer, ISwap swapper ) : System | ||
| Sort ( IList list ) : void |
| Méthode | Description | |
|---|---|---|
| InsertionSort ( IList list, int lo0, int hi0 ) : void | ||
| QuickSort ( IList list, int l, int r ) : void |
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. If you think of a one dimensional array as going from the lowest index on the left to the highest index on the right then the parameters to this function are lowest index or left and highest index or right. The first time you call this function it will be with the parameters 0, a.length - 1. |
| public FastQuickSorter ( IComparer comparer, ISwap swapper ) : System | ||
| comparer | IComparer | |
| swapper | ISwap | |
| Résultat | System | |