let i be in 1,....n^2 use bisection on that interval taking i%n and i/n to access the matrix and check the bisection condition.
On Aug 20, 4:42 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 -~----------~----~----~----~------~----~------~--~---
