I think that with this kind of problem, you can process in two steps.
A first easy problem with small N (to test perms for example). And a harder problem with big N, which
oblige to find another algorithm.
Find the sum of the elements in the "second" diagonal
Construct an index vector from two input vectors in vectorized fashion
Set the array elements whose value is 13 to 0
How long do each of the stages of the rocket take to burn?
Length of the hypotenuse
Diophantine Equations (Inspired by Project Euler, problem 66)
High Precision Square Root (Inspired by Project Euler 80)
How brilliant are you?
Break it up! Break it up!
Now 20% off!
Find the treasures in MATLAB Central and discover how the community can help you!
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