Use Binary Search start = 2^n-1 high =2^n where n=0,1....
On Mon, Oct 24, 2011 at 12:28 AM, sunny agrawal <sunny816.i...@gmail.com>wrote: > hint 1: try to find 2 indexes i, j such that a[i] <= K <= a[j] > > > On Sun, Oct 23, 2011 at 11:23 PM, Ankuj Gupta <ankuj2...@gmail.com> wrote: > >> Given a sorted array of Infinite size, find an element âKâ in the >> array without using extra memory in O (lgn) time >> >> -- >> 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. >> >> > > > -- > Sunny Aggrawal > B.Tech. V year,CSI > Indian Institute Of Technology,Roorkee > > > -- > 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. > -- 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.