Home.... | log in.... | Pub my question! | Sign-up....
Java-index >> Other Topics >> Algorithms

photo number sorting algorithm

if there are millions of phone numbers that need to be sorted, does anybody know if there is a most proper algorithm out there?I have been searching, but can't find a good one. Thanks.
[206 byte] By [caesarkim1a] at [2007-11-26 14:43:43]
«« Need some help with Payroll assignment.
»» listFiles with filter & memory problems
# 1
The librarys (Arrays, Collections) use QuickSort, which is pretty fast.Depending on how you're getting data, Insertion sort might alsobe appropriate.
es5f2000a at 2007-7-8 8:31:22 > top of Java-index,Other Topics,Algorithms...
# 2

Every comparison-based sorting algorithm has a complexity of Omega(n * log n).

You might want to take a look at Radix Sort which has a complexity of O(n*k) where k is the number of digits. One of its drawbacks is that it can not be done in place.

http://en.wikipedia.org/wiki/Radix_sort

horstmeyera at 2007-7-8 8:31:22 > top of Java-index,Other Topics,Algorithms...
# 3

If you use any reasonable algorithm your millions of phone numbers will be sorted in less time than it takes to read this reply. Perhaps the real question is why are you sorting those numbers over and over and over so that choice of algorithm matters in the slightest. Sort them once and keep them sorted.

marlin314a at 2007-7-8 8:31:22 > top of Java-index,Other Topics,Algorithms...
Other Topics
Algorithms

Other Topics New Topic

Other Topics Hot Topic

Other Topics

All Classified