Hi,
I came across the following question a couple of days back -
There are n women sitting at positions (0, 1), (0, 2), . . . , (0, n) in
the plane, and there
are n men sitting at positions (1, 1), (1, 2), . . . , (1, n). Each woman
is interested in
communicating with only a subset of the
we are given a sorted array A[1...n] , composed of distinct integers,
(the values can be negative). We want to determine if there is an
index i such that A[i] = i.
Give an O(logn) algorithm to solve this problem , and justify its
correctness
--
You received this message because you are