Problem
Suppose that each row of an n × n array A consists of 1's and 0's such that, in any row of A all the 1's come before any 0's in that row. Assuming A is already in memory, describe a method running in O(n) time (not O(n 2 ) time) for finding the row of A that contains the most 1's.