Question: Given that Insertion sort is worst case (n2) and Merge sort is worst case (nlg n): Under what conditions would Insertion sort outperform Merge
Given that Insertion sort is worst case θ (n2) and Merge sort is worst case θ(nlg n):
Under what conditions would Insertion sort outperform Merge sort? You can give a concrete example of this and show/plot the growth of the function as a graph.
Describe scenario(s) in which Insertion sort may be preferable to Merge sort as it is implemented in the pseudocode ?
Step by Step Solution
3.51 Rating (154 Votes )
There are 3 Steps involved in it
Now lets consider a concrete example and visualize the growth of these sorting algorithms using a gr... View full answer
Get step-by-step solutions from verified subject matter experts
