Let A be an array with n distinct integer elements in sorted order. Consider the following...

 

Transcribed Image Text:

Let A be an array with n distinct integer elements in sorted order. Consider the following algorithm IDFIND(A, j, k) that finds an i {j... k} such that A[i] = i, or returns FALSE if no such element i exists. 1 IDFIND(A, j, k) if jk return FALSE 2 3 Set i := ... 4 if A[i]=... return ... 5 if A[i] Let A be an array with n distinct integer elements in sorted order. Consider the following algorithm IDFIND(A, j, k) that finds an i {j... k} such that A[i] = i, or returns FALSE if no such element i exists. 1 IDFIND(A, j, k) if jk return FALSE 2 3 Set i := ... 4 if A[i]=... return ... 5 if A[i]