On a real computer, what will happen if you
make a recursive call that never makes the problem size
smaller?
The run-time stack overflows, halting the program
- The operating system detects the infinite recursion
because of the repeated state
- The program keeps running until you stop it
- The results are nondeterministic
Without making the problem smaller, the program will
keep calling itself until the stack is full.