QuickSort

[lovis...@gmail.com]

QuickSort  QuickSort is an implementation of Tony Hoare's classic QuickSort. QuickSort works by choosing a pivot point and ensuring all elements below the pivot point are small all above are big, (i.e. smaller than the pivot) Then it recursively splites the upper and lower halves, repeating the process. QuickSort is an internal sort written in Java. Both RadixSort and HeapSort are quicker than QuickSort. Qui http://rogdai.info/details.php?progid=3489