medium
2 min read
Recursion
Recursion Explained Recursion is a technique in programming where a function calls itself. This allows a program to perform a task by breaking it down into s...
Quick Actions
Insights
Difficultymedium
Reading Time2 min
Recursion Explained Recursion is a technique in programming where a function calls itself. This allows a program to perform a task by breaking it down into s...
Recursion is a technique in programming where a function calls itself. This allows a program to perform a task by breaking it down into smaller subtasks that are simpler versions of the original task.
Here's how recursion works:
Base Case: At the start of the function, a base case is checked. If the base case is met (e.g., a number is 0 or a list is empty), the function stops and returns a result or performs a specific action.
Subtask: If the base case is not met, the function performs a subtask that is a simpler version of the original task.
Recursion: The function then calls itself with the subtask result as an argument.
Combine Results: The results of the subtasks are then combined to form the final result of the original task.
Examples:
1. Factorial Function:
python
def factorial(n):
if n == 0 or n == 1:
return 1
else:
return n * factorial(n-1)
2. Fibonacci Sequence:
python
def fibonacci(n):
if n == 0 or n == 1:
return n
else:
return fibonacci(n-1) + fibonacci(n-2)
3. Checking if a Number is Prime:
python
def is_prime(n):
if n <= 1:
return False
for i in range(2, int(n**0.5) + 1):
if n % i == 0:
return False
return True
By understanding recursion, you can write programs that can solve complex problems by breaking them down into smaller, easier subtasks