can anyone say at which point it is preferable to use InsertionSort instead of MergeSort.
I don't mean at array size but at how much of the array is already sorted
>YouTube Reactions
>YouTube tests a new feature that allows users to express their reactions without posting silly comments. They can just click one of the six buttons (LOL, OMG, EPIC, CUTE, WTF, FAIL) and instantly tag the video.
One step closer to Idiocracy.
ehh, what do you guys mean by 98% sorted? The only metric I can think of would be the number of inversions. But yeah, you could probably figure out from the number of inversions how many array assignment operations would be performed by a simple implementation of insertion sort, merge sort, quick sort, and such, although it would be difficult. The actual performance on a CPU with a cache can depend on a lot more it might be better to test implementations empirically by timing their execution on different types of arrays, and see how they do. Also, quick sort is the bestest.