Explain the concept of recursion in Python with an example.

Question

Aryan Kumar · Answer

Sure. Recursion is a programming concept in which a function calls itself. This can be used to solve problems that can be broken down into smaller and smaller subproblems.

For example, the following function recursively reverses a string:

Python

def reverse_string(string):
  if len(string) == 0:
    return ""
  else:
    return string[-1] + reverse_string(string[:-1])

The reverse_string() function first checks if the string is empty. If it is, the function returns an empty string. Otherwise, the function returns the last character of the string plus the result of calling the reverse_string() function on the rest of the string.

This function works by recursively calling itself to reverse the rest of the string. The first time the function is called, it reverses the last character of the string. The second time the function is called, it reverses the last two characters of the string. This process continues until the function has reversed the entire string.

Recursion can be a powerful tool for solving problems. However, it is important to use it carefully. If a recursive function is not written correctly, it can lead to infinite recursion, which can cause your program to crash.

Here are some other examples of recursive functions in Python:

The factorial() function, which calculates the factorial of a number.
The fibonacci() function, which calculates the Fibonacci sequence.
The towers_of_hanoi() function, which solves the Towers of Hanoi puzzle.

forum

Explain the concept of recursion in Python with an example.

Can you answer this question?

1 Answers