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.
Calculate the Levenshtein distance between two strings
Find matching parenthesis
Solve the set of simultaneous linear equations
Sum of diagonal of a square matrix
Derivative of polynomial
Order of things - 4
Return 'on' or 'off'
Wayfinding 1 - crossing
Robust alignment of coordinate system
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