Redo your first assignment on Fibonacci and Mobius problem. This assignment will practice on doing recursive functions. Make sure that you understand what are you submitting in the class.
- Apply your knowledge on recursion both tail recursion and non-tail recursion.
- Include in your submission a test case for every function you have implemented. Maybe a printscreen of your work. Make sure that they will work before doing next instructions. Do not proceed if your function will fail.
Note: I just want you to practice the language and I hope that you will appreciate the language. I know it is quite difficult to learn functional programming. Even me I sometimes forgot the syntax but I do understand what behind its design and implementations. So, please participate and you will pass the course. That's all what I need from you. Focus and participation.
No comments:
Post a Comment