Can you provide some running examples to illustrate the concept of recursion in programming?

Answer 1

Recursion in programming is when a function calls itself to solve a problem. For example, a common recursive function is calculating the factorial of a number. Here's an example in Python:

python def factorial(n): if n 0: return 1 else: return n factorial(n-1)

print(factorial(5)) Output: 120

Another example is the Fibonacci sequence, where each number is the sum of the two preceding ones. Here's a recursive function to calculate the nth Fibonacci number:

python def fibonacci(n): if n 1: return n else: return fibonacci(n-1) fibonacci(n-2)

print(fibonacci(6)) Output: 8

These examples demonstrate how recursion can be used to solve problems by breaking them down into smaller, simpler subproblems.