So far we have discussed four sorting algorithms in the

course merge sort, insertion sort, heap sort and quick sort. Consider

an array A$=1,3,5,10,7,15,21,14,27,32,39,41$ and answer the

questions below.

$($a$)$ What do you expect from the performances of these algorithms on

the above data set. You can talk about if algorithm is going to do

more comparisons or less comparisons in this situation compare to

normal case and then give a big O estimate of all the algorithms.

$1$

$($b$)$ Based on the answer in part a which algorithm is most suitable

to use in the given situation.