Question: Given array A = (201, 19, 47, 51, 96, 24, 103, 40, 80, 33); answer the following: a. (4 points) Draw the tree of
Given array A = (201, 19, 47, 51, 96, 24, 103, 40, 80, 33); answer the following: a. (4 points) Draw the tree of recursive calls corresponding to sorting the array A using the merge sort algorithm. b. (2 points) How many times is the merge sort function called and how many times is the merge function called? c. (4 points) Draw the tree of recursive calls corresponding to sorting the array A using the quick sort algorithm that uses the last element as the pivot. d. (2 points) How many times is the quick sort function called and how many times is the partition function called?
Step by Step Solution
3.42 Rating (152 Votes )
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
