Algorithm Class

You are given a sorted $($from smallest

to largest$)$ array $A$ of $n$ distinct integers which can be positive, negative, or zero.

Design the fastest algorithm you can for deciding whether there is an index i such

that $A[i]=i.$ Analyze its running time.