What happens when a recursive function never encounters a base case?

When a recursive function never encounters a base case, it leads to infinite recursion. This means the function keeps calling itself indefinitely, consuming memory and CPU resources. Eventually, this results in a stack overflow error, causing the program to crash or terminate unexpectedly. Properly designed recursive functions must always include a base case to prevent this situation.