1. Starting with array S[] = {123, 34, 89, 56, 150, 12, 9) indexed from 1...

Transcribed Image Text:

1. Starting with array S[] = {123, 34, 89, 56, 150, 12, 9) indexed from 1 to 7: a) (15 pts) Sort S[] using Merge Sort. Show the recursive tree and indicate order of execution, i.e., label steps in tree nodes. b) (5 pts) For n = 32, in the best case Merge Sort would be expected to perform how many comparisons? 1. Starting with array S[] = {123, 34, 89, 56, 150, 12, 9) indexed from 1 to 7: a) (15 pts) Sort S[] using Merge Sort. Show the recursive tree and indicate order of execution, i.e., label steps in tree nodes. b) (5 pts) For n = 32, in the best case Merge Sort would be expected to perform how many comparisons?

Answer rating: 100% (QA)

lets start with part a of the question sorting the array S 123 34 89 56 150 12 9 using Merge Sort He... View the full answer