Travers the matrix in z-curve or hilbert-curve. This is a heuristic algo. Thus you can find largest square matrix.
On Oct 7, 10:39 am, malli <[email protected]> wrote: > Largest Rectangle in a Matrix: > > Given an n by n matrix with zeros and ones, find the largest sub- > matrix full of ones in linear time. I was told that a solution with > O(n) time complexity exists. If there are n^2 elements in a n X n > matrix how does a linear solution exist? -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
