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 Solvers27
Suggested Problems
-
4361 Solvers
-
Matrix indexing with two vectors of indices
734 Solvers
-
Create a vector whose elements depend on the previous element
713 Solvers
-
233 Solvers
-
9570 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!