A more general problem is discussed in "Introduction to Algorithms" by Cormen et al problem 6-3, although the running time is O(n)... nagendra kumar wrote: > How can we find an element in the matrix [n*n] which is sorted row > wise and column wise in O(log n). > > > > >
--~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
begin:vcard fn:Anil C R n:C R;Anil email;internet:cr.a...@gmail.com version:2.1 end:vcard
