@pramod yeh u r rite..
On Thu, Aug 20, 2009 at 10:20 PM, Pramod Negi <negi.1...@gmail.com> wrote: > I guess it is famous "Younge Tableau" Problem of tableau MxN and searching > can be done in O(M+N). > I doubt the problem can be solved in O(lgn) if no space constraint and no > pre-processing constraint present. > > > On Thu, Aug 20, 2009 at 9:42 PM, Anil C R <cr.a...@gmail.com> wrote: > >> 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 -~----------~----~----~----~------~----~------~--~---
