RadixSort 1.6

RadixSort is an internal sorting program that takes a different approach to sorting lists. This one uses a card sorting approach to the problem while comparing two elements. Individual computer bytes are extract from the keys that are being sorted. The key length for the items being sorted is the crucial factor rather than the number of items being sorted and so the RadixSort program approach is far more efficient with larger sorting volumes because the time taken to complete a sort isn't affected by volume.

RadixSort Key Features:

• Card sorting approach to sorting lists
• Compares two items
• Extracts the computer bytes from the keys
• Key length is the deciding factor not the volume of items to be sorted
• Fast sorting
• Requires Java 1.7 or later
• Requires Windows

RadixSort is a different kind of sorting program that runs on Java.