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
-
Extract leading non-zero digit
2022 Solvers
-
Create a cell array out of a struct
1574 Solvers
-
Back to basics 12 - Input Arguments
586 Solvers
-
Flag largest magnitude swings as they occur
668 Solvers
-
We love vectorized solutions. Problem 1 : remove the row average.
802 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!