Give an efficient algorithm to determine if there exists an integer i such that Ai = I

Question:

Give an efficient algorithm to determine if there exists an integer i such that Ai = I in an array of integers A1 < A2 < A3 < · · · < AN. What is the running time of your algorithm?
Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: