Problem 42837. Increasing sub-sequence (Level 1)
Given a vector, v, of real numbers, return a positive integer, n, representing the longest contiguous increasing sub-sequence contained in v.
Example:
v = [2 18 9 6 11 20 25 3]
n = 4
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers26
Suggested Problems
-
Renaming a field in a structure array
1435 Solvers
-
1105 Solvers
-
133 Solvers
-
438 Solvers
-
Find my daddy long leg (No 's')
2117 Solvers
More from this Author45
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!