Given that Insertion sort is worst case (n2) and Merge sort is worst case (nlg n):

3. Given that Insertion sort is worst case θ (n2) and Merge sort is worst case θ(nlg n):

   1. 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.

   2. Describe scenario(s) in which Insertion sort may be preferable to Merge sort as it is implemented in the pseudocode ?

Answer rating: 100% (QA)

Now lets consider a concrete example and visualize the growth of these sorting algorithms using a gr... View the full answer