Bloodstein Posted July 21, 2003 Posted July 21, 2003 I've got a collection that I'd like to sort. It is of highest priority that the sorting has to be fast. Memory space is an issue but not as much as sorting speed. Also, I'd like the sorting algorithm to work fairly well for large (infinity) number of objects as for small number of objects. Is there any sorting algorithm that does this. Quicksort is good...but i heard after a certain number of elements, the algorithm slows down rapidly. Quote
*Experts* mutant Posted July 22, 2003 *Experts* Posted July 22, 2003 You say you have a colletion so Im assuming you have an array or ArrayList . Did you try the sort method of the array? Quote
JABE Posted July 22, 2003 Posted July 22, 2003 You can also look into the IComparer and IComparable interfaces and how you can use it w/ a call to Array.Sort(). That way, you don't have to devise your own sorting algorithm. Quote
Recommended Posts
Join the conversation
You can post now and register later. If you have an account, sign in now to post with your account.