kumar wrote:
> Let A is an array of positive or negative
> integers of size n, where A[1] < A[2] < A[3] < ... < A[n]. Write an
> algorithm to find an i such that A[i] = i provided such i exists. What
> is the order of execution time of algorithm. Prove that O ( log n ) is
> the best possible..
A
On 8/4/06, kumar <[EMAIL PROTECTED]> wrote:
>
> Let A is an array of positive or negative
> integers of size n, where A[1] < A[2] < A[3] < ... < A[n]. Write an
> algorithm to find an i such that A[i] = i provided such i exists. What
> is the order of execution time of
