Quote:
Originally Posted by Tolnaftate2004
If you're looking for something even a bit more efficient, I would look up the quicksort algorithm.
|
Yeah, that would also fall under the
O(n log n) that napo addressed. I believe that the algorithms course that we have over here is an upper-division course, so I suppose I'll get into the higher-level sorting methods as I progress into the major.