If an array is given as input then find the index of consecutive elements that represent maximum change.
Input x = [1 10 3 0 2 4 0 -8 9 1]
Output y = [8 9]
Additional test cases have been added.
All your base are belong to us
Project Euler: Problem 10, Sum of Primes
The Answer to Life, the Universe, and Everything
Find the index of n in magic(n)
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office