The simplest factorial is . This is defined mathematically and gives you a natural stopping point. When you recursively call factorial with smaller and smaller numbers, you will eventually reach .
At that point, you return immediately without any more recursion. Some definitions also treat as a base case, which works too. Either way, the base case must be explicit and return a value directly. This is the anchor that stops the chain of recursive calls.
