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
3129 Solvers
2810 Solvers
Project Euler: Problem 10, Sum of Primes
515 Solvers
How many trades represent all the profit?
437 Solvers
208 Solvers
Solution 1564789
Learned from Solution 883700, by Tim. run this just for checking: I reckon that function "sum" in that solution is redundant, and my guessing seems to be right.