You can read the task, take hints and check your answer — but nothing is saved. No XP, no skill points, and this task will not be marked complete.
Write `factorial(n)` recursively. `factorial(0)` must return 1.
What this proves: Write a terminating recursion with an explicit base case.
Need assistance? You can reveal sequential hints. Each hint applies a minor penalty to your score.
If you are completely stuck, you can unlock the full step-by-step walkthrough.