isnt this quest a lil wrong. coz suppose if i dnt know the length of an array,then how will i access the last element of the array.in such a case,i will almost traverse the whole memory and still not stop. coz compiler does not give array out of bound exception. Ashima M.Sc.(Tech)Information Systems 4th year BITS Pilani Rajasthan
On Fri, Sep 30, 2011 at 6:06 PM, pssaravanan <saravananselvam...@gmail.com>wrote: > If the length of the array s not known,v could not apply the binary > search to search for an element. i think following code will produce > better solution. > > i = 0; > for(i = 0;A[i] < p&& A[i] !=NULL;i = (i+1)^2); > j = i; > i = sqrt(i)-1; > applybinarysearch(i,j); > > -- > 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.
