Given an ordered array A[1…n] with numbers in strictly increasing order. Find a ‘j’ such that A [j]=j or -1 if no such number exist in o (log n).
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
