Explain how the selection of pivot plays major role in efficiency of quick sort algorithm and determine the complexity of the quick sort. Trace the steps of insertion sort for the list of numbers: 12,...

Explain how the selection of pivot plays major role in efficiency of quick sort algorithm and determine the complexity of the quick sort.

Trace the steps of insertion sort for the list of numbers: 12, 19, 33, 26, 29, 35, 22. Compute the total number of comparisons made.

What is shell sort? Define the worst case analysis of shell sort.