A recursive function is a function that calls itself as part of its execution. This elegant technique allows a complex problem to be solved by breaking it down into smaller, identical sub-problems, much like a Loop, always requiring a Base Case to terminate the calls.
See also