This is simple problem based on problems 555, 801, 1118, etc.
Create an index vector from two input vectors.
input: [1 8 12] [4 5 9]
output: [1 2 3 4 8 7 6 5 12 11 10 9]
Find the longest sequence of 1's in a binary sequence.
Most nonzero elements in row
Project Euler: Problem 10, Sum of Primes
Magic is simple (for beginners)
07 - Common functions and indexing 2
Pancakes for everyone!
Best Problem Elections
Modify subscripts - easier
(Linear) Recurrence Equations - Generalised Fibonacci-like sequences
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