About 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
Previous Versions
Here you can find the changelog of RadixSort since it was posted on our website on 2015-04-27 03:00:00.
The latest version is 1.6 and it was updated on 2024-04-22 20:04:57. See below the changes in each version.
RadixSort version 1.6
Updated At: 2008-01-01
Changes: bundle with pad and ant scripts
Disclaimer
External Download
We do not host RadixSort on our servers. We did not scan it for viruses, adware, spyware or other type of malware. This app is hosted by the software publisher and passed their terms and conditions to be listed there. We recommend caution when installing it.
The external download link for RadixSort is provided to you by apps112.com without any warranties, representations or guarantees of any kind, so access it at your own risk.
If you have questions regarding this particular app contact the publisher directly. For questions about the functionalities of apps112.com contact us.