Shell Sort vs Heap Sort vs Quick Sort
i am having a debate as to which of the sort is more efficient in 2 cases:
when a 2d array of size 50, 100, or 1000 of randomly generated integers
and the same 2d array with all numbers sorted but only 2 indexes where their values have been exchanged.
for these 2 cases which of the 3 sorts seems more efficient.. i am pretty sure the quick sort is the best for the randomly generated array..
but what about the other case... the problem that is bugging me is that when the size is small the difference in the number of comparisons made with quick sort is very similar to the shell sort :)...
any suggestions welcomed :)