Compute five factorial with a loop.
Acceptance criteria
- 1.#out should show result 120.
DSA Tutorial · Recursion
Practice: Turning Recursion Into Iteration
These 10 tasks go with the Turning Recursion Into Iteration chapter. 5 of them ask you to build something small from scratch; 5 give you code that is already broken and ask you to work out why. Set aside about 90 minutes for the whole set, though you can do them in any order.
Nothing here is marked by a person. When you press Submit, the editor checks your code against the points listed under each task and tells you straight away what passed and what didn't (you need a free account to submit). If you get stuck, there are hints, and a worked solution once you've had a go. The first 2 tasks are free; the rest are part of the practice plan.
If it's been a while since you read the chapter, here is how it starts: “Recursion uses the call stack. An iterative version uses a stack you control. The logic is identical; the difference is that your stack lives on the heap and does not overflow at ten thousand frames.” .