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. QuickSort can also take pathologically long times if there is too much pre-existing order in the items to be sorted. This code is primarily for teaching purposes. It sorts using a routine you provide to compare two elements to be sorted. You can test it with java.exe -jar quicksort.jar

Changes: bundle with pad and ant scripts

Minimum requirements: Java 1.7+

Operating system: Java,Linux,Mac OS X,Unix,Win2000,Win7 x32,Win7 x64,WinServer,WinVista,WinVista x64,WinXP

Program URL: http://mindprod.com/products2.html#QUICKSORT

You may include QuickSort any CD compilation. You may not sell QuickSort. It is free.

This program is for non-military use only. For details on what that licencing restriction means and why I restricted this software that way, see http://mindprod.com/contact/nonmil.html If you incorporate any of my code in your programs, they too must be marked for non-military use only. However it is not your responsibility to enforce that restriction.

Read more