1. Show how the values in the array in Exercise 1 would be arranged immediately before the execution of the function Merge in the original (nonrecursive) call to MergeSort. 2. Show how the values in the array in Exercise 1 would be arranged immediately before the first recursive call to QuickSort.

Exercise 1

Show the contents of the array

after the fourth iteration of

1. BubbleSort

2. SelectionSort

3. InsertionSort

Transcribed Image Text:

43 [0] 7 [1] 10 [2] 23 [3] 18. [4] 4 [5] 19 [6] 5 [7] 66 [8] 14 [9]