RadixSort
RadixSort is a fast internal sort written in Java that mimics a card sorter.
RadixSort is a fast internal sort written in Java that mimics a card sorter. Source provided. It is faster than both HeapSort and QuickSort. It sorts using a comparision routine you provide to compare two elements to be sorted plus a method to extract individual bytes from the keys to be sorted. The time to sort each item unlike most sorts, does not increase with larger sorts. It depends rather on the key length. You can test it with: java.exe -jar radixsort.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#RADIXSORT
RadixSort screenshot
Special permissions
You may include RadixSort any CD compilation. You may not sell RadixSort. It is free.
EULA
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.