Question: We are given an array A of integers which is strictly increasing, i.e., A[i] < A[i+ 1]. Give a divide-and-conquer algorithm which outputs an index
We are given an array A of integers which is strictly increasing, i.e., A[i]< A[i+ 1]. Give a divide-and-conquer algorithm which outputs an index i such that A[i] = i, if one exists.If no such index exists, the algorithm outputs null. Formally analyze the runtime of your algorithm, giving a recurrence relation and a big oh bound on the runtime of your algorithm.You must use a divide and conquer strategy. You do not have to prove correctness.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
