Eh. I can see what you're going for here, but I really think these heavily-restricted problems aren't very relevant for anything practical. If you're tasked with implementing a solution to a particular problem, such things as running time, memory consumption and numerical stability may well be on your mind, but not using anything from a long list of basic control structures and functions... not so much.
Solve other problems from the problem set, Basics - Fibonacci, and the answer will reveal itself to you (after a little reflection). I promise.
Could you please tell me how to use recursion without condition?
this seems a bit silly
Just convert the result to uint32 xd
I hope you will not change the test suite to restrict this ;)
sorry, I forgot to rewrite,so changed.
just kidding. nice problem :)
this is what I want
Very nice! At first the problem felt a bit heavy handed with all those restrictions (no "if", no "round"???) but I see now what you were going for and I like it :)
recursion of anonymous is from the blog of Loren.
the first test (checking 'for' loops, etc.) is not really doing anything...
Thank you , have fixed it.
The thing about these "don't use this don't use that" problems is that there are so many ways around such restrictions.
you are right,it inspires us to create a lot of new idea that is my purpose
Arrange Vector in descending order
Doubling elements in a vector
Find out missing number from a vector of 9 elements
kmph to mps
Symmetry of vector
Seperate array to small section according to its index position
Determine if input is a Narcissistic number
Make an anonymous function that has variable output
Solve Sudoku puzzle step by
Generate a vector like 1,2,2,3,3,3,4,4,4,4
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