Data structure 15

Sorting (10 marks) This question is about Sorting. Consider the following integer sequence S: 23, 33, 12, 3, 10, 77, 54,42 [sort in ascending order] S is to be sorted in ascending order. Assume we use an array of size 8 to store the integers. Show the contents of the array with each step. The final step is a sorted array. Show your steps in using bubble sort to sort S. In order to show the steps, show the contents of the array after each scanning of the array E.g. the first intermediate array is shown as follows: a) 23 12 3 10 33 54 42 77 b) Suppose we use quicksort to sort S. Use Median-of-three method to choose the pivot, i.e. pick among a[1],a[n],a[n/2] if the partition is all ..n]. Mote that during the pivot selection, a[l], a[n/2], a[n] will be sorted. Show the contents of the array after the first pivot is restored to its proper position from the end of the partition