Question: Problem 2. (30 points) Let A[1..n] be a sorted array of distinct integers. You want to find out if there is an index i such
![Problem 2. (30 points) Let A[1..n] be a sorted array of](https://s3.amazonaws.com/si.experts.images/answers/2024/09/66d6ba85c0642_48566d6ba8547201.jpg)
Problem 2. (30 points) Let A[1..n] be a sorted array of distinct integers. You want to find out if there is an index i such that A[i - i. Give a divide and conquer algorithm that solves this problem and runs in time Olgn). Write a peeudocode of your algorithm. Explain why your algorithm is correct. Justify the bound for the running time of your algorithm
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
