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 Solvers29
Suggested Problems
-
Remove the small words from a list of words.
1544 Solvers
-
Generate N equally spaced intervals between -L and L
916 Solvers
-
Who is the smartest MATLAB programmer?
775 Solvers
-
Rounding off numbers to n decimals
5227 Solvers
-
Check that number is whole number
4936 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!