Question: 1) Define and compare between Big 0, 1, and . You could provide example graphs to clarify your answer. (1 mark) 2) Describe a divide-and-conquer


1) Define and compare between Big 0, 1, and . You could provide example graphs to clarify your answer. (1 mark) 2) Describe a divide-and-conquer algorithm to find the maximum number of a set of n numbers. Assume that n is a power of 2. Describe the divide, conquer, and combine steps of the algorithm in clear words. What is the running time complexity of your algorithm? (2 marks) 3) Using the recursive tree method, find the time complexity of each of the following. (2 marks) A. The recursive search of a balanced binary search tree B. T(n) = T(n-1) + n 4) Using the Master method, find the time complexity of each of the following. (2 marks) A. T(n) = 7T(n/2) + n2 B. T(n) = 9T(n/3) + n3 log n C. T(n) = 2T(n/2) + log n D. T(n) = 7T(n/3) + n2 5) Find the worst-case complexity for each of the following algorithms (2 marks) Execution steps and Time complexity Algorithms 1. sum = 0 2. for (int i = 1;i
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
