Download QuickSort 1.6

Publisher's description

QuickSort is an implementation of Tony Hoare's classic recursive Quicksort.

QuickSort is an implementation of Tony Hoare's classicQuickSort. QuickSort works by choosing a pivot point andensuring all elements below the pivot point are small allabove are big, (i.e. smaller than the pivot) Then itrecursively splites the upper and lower halves, repeatingthe process. QuickSort is an internal sort written in Java.Both RadixSort and HeapSort are quicker than QuickSort.QuickSort can also take pathologically long times if thereis too much pre-existing order in the items to be sorted.This code is primarily for teaching purposes. It sorts usinga routine you provide to compare two elements to be sorted.You can test it withjava.exe com.mindprod.quicksort.TestQuickSort

Available Translations: