Question: 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

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)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
