Radixsort

RadixSort 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... Platforms: Windows, XP, Windows Vista

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... Platforms: Windows, XP, Windows Vista