O(logn) binary search if there are no duplicates, else O(n) On Thu, Mar 3, 2011 at 11:04 AM, Param10k <paramesh...@gmail.com> wrote:
> There is a sorted array and you have to write a fn to find a number in > the array which satisfies > > A[i] = i ; where A is the array and i is the index... > > - Param > http://teknotron-param.blogspot.com/ > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- Regards, Arpit Sood -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
