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
-
The Hitchhiker's Guide to MATLAB
3327 Solvers
-
686 Solvers
-
Create an array (n,n) where only diagonal elements are '1' and others are '0'
84 Solvers
-
39 Solvers
-
Find my daddy long leg (No 's')
2477 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!