0

Hi guys,

Do anyone knows how we can implement this code:

Write an efficient recursive function called IndexEqual(A,i,j) that returns true if there

exists an index x (i < x < j) such that A[x] = x, otherwise returns false. You may assume A is a

sorted integer array in which every element is unique.

I need a help quickly.