If it is o(n) only then we can do a normal search. But data is sorted left and down so how to use this property.
On Thu, Aug 20, 2009 at 8:12 PM, Dufus<rahul.dev.si...@gmail.com> wrote: > > AFAIK, searching an element in sorted matrix (Young's Tableau) takes O > (n) time. > So I am not sure if O(logn) is actually possible. > > _dufus > > > > On Aug 20, 6:41 pm, nagendra kumar <nagendra....@gmail.com> 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 -~----------~----~----~----~------~----~------~--~---
