1. Given the following list After merge method 1 2 107, 22, 53, 85, 211, 16,...

Transcribed Image Text:

1. Given the following list After merge method 1 2 107, 22, 53, 85, 211, 16, 97, 6, 32 a. Use merge sort to fill the following table that shows the value of first and last arguments in calling the quick sort method and the content of the list after each merging Content of list [0] [1] [2] [3] [4] [5] [6] [7] [8] first last b. Use number of elements in the merge sort in part a to draw the merge sort tree that shows the divide process. c. Give the number of times the merge sort and the merge method are called in your solution of part a. 1. Given the following list After merge method 1 2 107, 22, 53, 85, 211, 16, 97, 6, 32 a. Use merge sort to fill the following table that shows the value of first and last arguments in calling the quick sort method and the content of the list after each merging Content of list [0] [1] [2] [3] [4] [5] [6] [7] [8] first last b. Use number of elements in the merge sort in part a to draw the merge sort tree that shows the divide process. c. Give the number of times the merge sort and the merge method are called in your solution of part a.

Answer rating: 100% (QA)

It seems that theres a bit of confusion in the question provided The text refers to both merge sort and quicksort which are two different sorting algo... View the full answer