Lots of them. Quicksort and heap sort are you best bets. O(n log n) complexity while bubblesort is O(n^2). Dean martin.p.burns at uk.pwcglobal.com writes: > Bubblesort is great, but it always struck me as a bit > inefficient. Are there any quicker ones? > > Martin