Conrado Sanchez wrote:Merge sort is only efficient for sorting a small number of items if you only need to sort a large array once.
Anyone agree of disagree with this statement?
Depends on what you mean by "efficient". It's actually more efficient, comparison-wise, than Quicksort, but less efficient in space - and possibly also in the number of moves or "swaps" it generates (don't know).
Another advantage it has is that it's stable, which can be important. Not all sort algorithms are.
"Leadership is nature's way of removing morons from the productive flow" - Dogbert
Articles by Winston can be found here