There is a 2 dimensional array with each cell containing a 0 or 1 , Design an algorithm to find out which row has the maximum number of 1's , Your algorithm should have O(n2) time and no space complexity.
-- 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.
