Without an exit condition, a recursive function can crash a program by overflowing its stack

A function commanding itself to run again is the digital equivalent of holding two mirrors facing each other. If the exit condition is poorly written, the routine blindly calls itself over and over, rapidly stacking up memory layers. The stack continues growing in panic until the operating structure forcefully violently terminates the application.