2. Sorting Algorithm Exercises Show the results of each swap (exchange) applying the given sorting algorithm on the following set of initial array values. BUBBLE SORT SELECTION SORT 32 8 16 4 24 64 32 8 16 4 24 64 2.

Question 2 a) Illustrate the operation of Insertion sort algorithm on the array (4, 18, 1, 30, 7, 8, 3, 11, 25, 16, 10}. (Show the array after each outer loop iteration) b) How many comparisons are performed by the algorithm on the above array?

Sorting Algorithm   1.) Trace the quick sort’s partitioning algorithm as it partitions the following array: 38 16 40 39 12 27

In quick sort, if the input array is already sorted, which of the following algorithm will still perform at-least one swap.     a Lomuto's algorithm   b Both Lomuto's and Hoare's algorithms   c none of Hoare's or Lomuto's algorithm   d Hoare's Algorithm