For this assignment, you will complete searching/sorting tasks and efficiency analysis. No code is to be written for this assignment.

Trace: Write out each iterative pass of the algorithm.

a) Trace selection sort on the following array of letters (sort into alphabetical order):

C Q S A X B T 

After each pass (outer loop iteration) of selection sort, show the contents of the array and the number of letter-to-letter comparisons performed on that pass (an exact number, not big-O).

b) Trace insertion sort on the following array of letters (sort into alphabetical order):

C Q S A X B T 

After each pass (outer loop iteration) of insertion sort, show the contents of the array and the number of letter-to-letter comparisons performed on that pass (an exact number, not big-O).