Since Cody, I dislike for-loops, but your solution is way simpler than my own algorithm. Mission accomplished...
Nevertheless, I would hope for a non-looped piece of code. Let's see in phase 3.
Remove any row in which a NaN appears
Count from 0 to N^M in base N.
Sum the Digits of a Number
Length of the hypotenuse
Only once: cleaning up your columns
Order of things - 3
Order of things - 1
Insert structure in a parameter-cell array.
Wayfinding 5 - Travel contour
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