Write a function that returns a function that counts the number of times it is invoked. Example:
>> h = counter;
Note: your solution cannot use persistent variables.
solution which does not use any nested function ;)
Add two numbers
Check if sorted
Count up then down
Sum the elements in either diagonal of a square matrix
Function composition - harder
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