RadixSort is stable, meaning it preserves existing order of equal keys. It works in linear time, unlike most other sorts. In other words, it does not bog down when you have large numbers of items to sort. The time per item to sort is constant. With other sorts, the time to sort per time increases with the number of items. Mathematicians would put it that most sorts run in O(n log(n)) or O(n²) time, where RadixSort runs in O(n) time.
Since all sorts can use the same Comparator interface, it is possible to experiment with various sorts to figure out which one works best for your situation.
This page is posted 
http://mindprod.com/jgloss/radixsort.html  
Optional Replicator mirror

J:\mindprod\jgloss\radixsort.html  
Please read the feedback from other visitors,
or send your own feedback about the site. Contact Roedy. Please feel free to link to this page without explicit permission.  
Canadian
Mind
Products
IP:[65.110.21.43] Your face IP:[34.239.154.240] 
 
Feedback 
You are visitor number  