@Arpit - Can you please explain how would you solve it using binary search?
On Wed, Mar 2, 2011 at 10:41 PM, Arpit Sood <[email protected]> wrote: > O(logn) binary search if there are no duplicates, else O(n) > > > On Thu, Mar 3, 2011 at 11:04 AM, Param10k <[email protected]> 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 [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. >> >> > > > -- > 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 [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. > -- 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.
