|
RadixSort is a fast internal sort written in Java thatmimics a card sorter. Source provided. It is faster thanboth HeapSort and QuickSort. It sorts using a comparisionroutine you provide to compare two elements to be sortedplus a method to extract individual bytes from the keys tobe sorted. The time to sort each item unlike most sorts,does not increase with larger sorts. It depends rather onthe key length. You can test it with: java.exe com.mindprod.radixsort.TestRadixSort
|
