Unformatted text preview: . 4) Given an array of 0’s and 1’s, we want to find the longest sequence of consecutive 1’s in it. For example, for the input array < 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0 >, the maximum such sequence is of length 4. Describe an algorithm for this problem and obtain the number of operations performed in terms of n, the size of the array. Express your...
View
Full Document
 Fall '08
 Kooshesh,A
 Algorithms, Data Structures, Web page, desktop computer, 8 bits, 1 second, 315 Week

Click to edit the document details