Question: 1. Problem Description. Write an O(log(n)) time divide and conquer algorithm in Pseudo Code to find the smallest number of an array A in which
1. Problem Description. Write an O(log(n)) time divide and conquer algorithm in Pseudo Code to find the smallest number of an array A in which the input array A first strictly decreases then strictly increases. For example, if A = (6,4,2,4,7,9), it first strictly decreases from 6 to 4 to 2, then it strictly increases from 2 to 4 to 7 to 9. Your algorithm is supposed to return the unique smallest element 2. No credit will be given to any algorithm that runs in more than O(log(n)). 2. Deliverables. You are required to submit an algorithm that solves the above
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
