"ocaml_beginners"::[] under tables of 1

algorithm which takes in entry a table (its elements are 0 and 1) and
2 indices I and J of this table such as 1<=i<;=j<=N and which returns
the position and the length of the longest sequence of "1&quot; consecutive
in under table T [I… J]

Messages in this topic (1) Reply (via web post) | Start a new topic

.