Home Resource Centre Recursion In Python - From Basics To Advanced With Code Examples

Table of content:

What Is Recursion In Python?
Key Components Of Recursive Functions In Python
Implementing Recursion In Python
Recursion Vs. Iteration In Python
Tail Recursion In Python
Infinite Recursion In Python
Advantages Of Recursion In Python
Disadvantages Of Recursion In Python
Best Practices For Using Recursion In Python
Conclusion
Frequently Asked Questions

Recursion In Python - From Basics To Advanced With Code Examples

Recursion in Python is a technique where a function calls itself to solve a problem. It involves a base case to stop the recursion and a recursive case to break the problem into smaller subproblems.

0 min read

Recursion In Python - From Basics To Advanced With Code Examples

Recursion is a powerful concept in programming where a function calls itself to solve a problem. It is often used to tackle problems that can be broken down into smaller, similar subproblems. In Python, recursion provides an elegant way to implement algorithms for tasks such as factorial calculation, Fibonacci series generation, and solving puzzles like the Tower of Hanoi.

In this article, we will explore the concept of recursion in Python, breaking down how it works, its syntax, benefits, and potential pitfalls. We'll also look at some practical examples and best practices to help you master this essential programming technique.

What Is Recursion In Python?

In Python programming, recursion is a technique where a function calls itself to solve a smaller instance of the same problem. This process continues until the problem becomes so simple that it can be directly solved, which is called the base case.

Recursion is particularly useful for problems that can be broken down into smaller, repetitive sub-problems, such as factorials, Fibonacci sequences, or traversing data structures like trees.

Key Components Of Recursion:

Base Case: A condition that stops the recursion to prevent infinite loops.
Recursive Case: The part of the function where the function calls itself with a smaller or simpler input.

Real-Life Analogy: The Mirror-In-Mirror Effect

Imagine two mirrors placed facing each other. When you look into one mirror, you see an infinite reflection of mirrors within mirrors. However, the reflections eventually fade away due to light limitations.

The base case: The fading reflections represent the stopping point of recursion.
The recursive case: Each mirror reflecting the other is like the function calling itself.

This analogy helps us understand how recursion keeps breaking the problem into smaller instances (like nested reflections) until it reaches a limit (base case).

Explore this amazing course and master all the key concepts of Python programming effortlessly!

Key Components Of Recursive Functions In Python

recursion in python

When writing a recursive function in Python, there are essential components that ensure the function works correctly and avoids infinite loops. Let's break these down:

Base Case: The base case is a condition that stops the recursion. Without it, the function will call itself indefinitely, leading to a stack overflow error.It defines the simplest scenario where no further recursive calls are needed. For Example-

if n == 0: # Base case
return 1

Recursive Case: This is the part of the function where it calls itself with a smaller or simpler input. Each recursive call should work towards making the input reach the base case.

return n * factorial(n - 1) # Recursive case

Function Arguments: The arguments passed to the function must change with each recursive call, progressing toward the base case. If the arguments don't lead to the base case, the recursion will never terminate.

factorial(n - 1) # `n` decreases with each call

Termination: The recursion stops when the base case is met. Proper termination ensures the function doesn’t continue calling itself indefinitely.

if n == 0: # Stops the recursion
return 1

Stack Memory Usage: Each recursive call uses stack memory to store the current function's state. Deep recursion can lead to a stack overflow error if the recursion depth exceeds Python's limit (default is 1,000).

Tip: For large problems, consider iteration or tail recursion optimization to save memory.

Implementing Recursion In Python

Recursion in Python is implemented through functions that call themselves. Each recursive call solves a smaller instance of the problem, working towards a base case that ends the recursion. A recursive function typically follows this structure-

Syntax:

def function_name(parameters):
if base_case_condition: # Base Case
return result # Stops the recursion
else:
# Recursive Case
return function_name(modified_parameters)

Here:

def function_name(parameters): It defines the recursive function with parameters that guide the recursion.
if base_case_condition: The stopping condition that terminates the recursion when met.
return result: It specifies the output for the base case.
else: return function_name(modified_parameters): It calls the function itself with modified parameters, solving smaller instances of the problem.

Let’s now look at an example to calculate factorial using recursion in Python.

Code Example:

ZGVmIGZhY3RvcmlhbChuKToKICAgIGlmIG4gPT0gMDogICMgQmFzZSBDYXNlOiBmYWN0b3JpYWwgb2YgMCBpcyAxCiAgICAgICAgcmV0dXJuIDEKICAgIGVsc2U6ICAjIFJlY3Vyc2l2ZSBDYXNlOiBuICogZmFjdG9yaWFsIG9mIChuLTEpCiAgICAgICAgcmV0dXJuIG4gKiBmYWN0b3JpYWwobiAtIDEpCgojIEV4YW1wbGUgdXNhZ2UKbnVtYmVyID0gNQpyZXN1bHQgPSBmYWN0b3JpYWwobnVtYmVyKQpwcmludChmIlRoZSBmYWN0b3JpYWwgb2Yge251bWJlcn0gaXM6IHtyZXN1bHR9IikK

Output:

The factorial of 5 is: 120

Explanation:

In the above code example-

We define a function factorial() that calculates the factorial of a given number n.
Inside the function, we check if n is 0. If it is, we return 1 since the factorial of 0 is 1. This serves as our base case to stop the recursion.
If n is not 0, we calculate the factorial recursively by multiplying n with the factorial of n-1. This step reduces the problem size in each recursive call.
We call the function with number set to 5. The recursive calls work as follows:

factorial(5) calls factorial(4)
factorial(4) calls factorial(3)
factorial(3) calls factorial(2)
factorial(2) calls factorial(1)
factorial(1) calls factorial(0), which returns 1.

Once the base case is reached, the function resolves each multiplication step in reverse order, ultimately calculating 5 * 4 * 3 * 2 * 1.
Finally, we print the result, showing "The factorial of 5 is: 120".

Recursion Vs. Iteration In Python

Recursion involves a function calling itself to solve a problem, while iteration uses loops (e.g., for or while) to repeat a set of instructions until a condition is met. The key differences between the two are as follows:

Aspect	Recursion	Iteration
Definition	A function repeatedly calls itself until a base case is met.	A loop structure repeatedly executes a block of code until a condition is met.
Termination	Requires a base case to stop further recursive calls.	Stops when the loop's condition evaluates to False.
State Storage	Uses the call stack to store intermediate states of the function.	Uses loop variables to track the state.
Performance	Generally slower due to function call overhead and stack memory usage.	Faster as no extra overhead from function calls is involved.
Memory Usage	Consumes more memory due to stack frames for each recursive call.	Memory-efficient as it doesn’t require additional stack frames.
Readability	Can be more concise and intuitive for problems like tree traversal.	Better for problems that involve simple repetitive tasks.
Complexity	Ideal for problems that are naturally recursive (e.g., factorial, Fibonacci).	Best for problems with straightforward repetition or iteration.
Risk	Risk of stack overflow if recursion depth exceeds the limit.	No such risk with iteration.
Example	factorial(n) calls itself until n == 0.	for or while loop to calculate factorial.

Code Example:

IyBSZWN1cnNpdmUgYXBwcm9hY2gKZGVmIGZhY3RvcmlhbF9yZWN1cnNpdmUobik6CiAgICBpZiBuID09IDA6ICAjIEJhc2UgY2FzZQogICAgICAgIHJldHVybiAxCiAgICByZXR1cm4gbiAqIGZhY3RvcmlhbF9yZWN1cnNpdmUobiAtIDEpICAjIFJlY3Vyc2l2ZSBjYWxsCgojIEl0ZXJhdGl2ZSBhcHByb2FjaApkZWYgZmFjdG9yaWFsX2l0ZXJhdGl2ZShuKToKICAgIHJlc3VsdCA9IDEKICAgIGZvciBpIGluIHJhbmdlKDEsIG4gKyAxKTogICMgSXRlcmF0aXZlIGxvb3AKICAgICAgICByZXN1bHQgKj0gaQogICAgcmV0dXJuIHJlc3VsdAoKIyBUZXN0aW5nIGJvdGggYXBwcm9hY2hlcwpudW1iZXIgPSA1CnByaW50KCJGYWN0b3JpYWwgKFJlY3Vyc2l2ZSk6IiwgZmFjdG9yaWFsX3JlY3Vyc2l2ZShudW1iZXIpKQpwcmludCgiRmFjdG9yaWFsIChJdGVyYXRpdmUpOiIsIGZhY3RvcmlhbF9pdGVyYXRpdmUobnVtYmVyKSkK

Output:

Factorial (Recursive): 120
Factorial (Iterative): 120

Explanation:

In the above code example-

We define two functions to calculate the factorial of a number, one using recursion and the other using iteration.
In the recursive approach (factorial_recursive):

We check if n is 0. If it is, we return 1 as the base case since the factorial of 0 is 1.
If n is not 0, we make a recursive call with n - 1 and multiply n by the result of that call.
For example, for n = 5, the calls proceed as: factorial_recursive(5) calls factorial_recursive(4), factorial_recursive(4) calls factorial_recursive(3).
This continues until factorial_recursive(0) returns 1, after which the results are multiplied step by step to give 5 * 4 * 3 * 2 * 1 = 120.

In the iterative approach (factorial_iterative):

We initialize a variable result to 1 to store the running product.
We use a for loop to iterate from 1 to n (inclusive), multiplying result by each number in the range.
For example, for n = 5, the loop proceeds as: result = 1 * 1, then result = 1 * 2, then result = 2 * 3, and so on until result = 120.

We test both functions with number = 5 and print the results.

Choosing Between Recursion and Iteration

Use Recursion: For tasks that can be broken into smaller sub-problems, such as tree traversal or divide-and-conquer algorithms.

Use Iteration: For straightforward tasks that involve repetitive actions, such as iterating over a list or performing simple calculations.

Sharpen your coding skills with Unstop's 100-Day Coding Sprint and compete now for a top spot on the leaderboard!

Tail Recursion In Python

Tail recursion is a specific type of recursion where the recursive call is the last operation in the function. This means that no further computation or processing is required after the recursive call returns. Tail recursion can be optimized in some programming languages through tail-call optimization (TCO), which allows the language to reuse the current stack frame for the recursive call, preventing stack overflow.

However, Python does not support tail-call optimization, which makes tail recursion as memory-intensive as regular recursion. Despite this, understanding tail recursion is valuable for writing cleaner, more maintainable code.

Syntax Of Tail Recursion In Python:

def function_name(parameters):
if base_case_condition: # Base Case
return result # Stops the recursion
else:
return function_name(modified_parameters) # Tail Recursive Call

In tail recursion, the recursive call (function_name(modified_parameters)) is the last operation in the function.

Python's Lack Of Tail-Call Optimization

Python does not implement tail-call optimization because it prioritizes simplicity and debuggability. As a result:

Each recursive call consumes a new stack frame, leading to potential stack overflow for deep recursion.
The recursion depth limit in Python (default: 1000) can restrict tail-recursive implementations for large inputs.

Here's how you can implement a factorial function using tail recursion-

Code Example:

ZGVmIGZhY3RvcmlhbF90YWlsX3JlY3Vyc2lvbihuLCBhY2N1bXVsYXRvcj0xKToKICAgIGlmIG4gPT0gMDogICMgQmFzZSBjYXNlOiB3aGVuIG4gcmVhY2hlcyAwCiAgICAgICAgcmV0dXJuIGFjY3VtdWxhdG9yCiAgICBlbHNlOgogICAgICAgIHJldHVybiBmYWN0b3JpYWxfdGFpbF9yZWN1cnNpb24obiAtIDEsIGFjY3VtdWxhdG9yICogbikgICMgVGFpbCByZWN1cnNpdmUgY2FsbAoKIyBUZXN0aW5nIHRoZSBmdW5jdGlvbgpyZXN1bHQgPSBmYWN0b3JpYWxfdGFpbF9yZWN1cnNpb24oNSkKcHJpbnQoIkZhY3RvcmlhbCBvZiA1IGlzOiIsIHJlc3VsdCkK

Output:

Factorial of 5 is: 120

Explanation:

In the above code example-

We define a function factorial_tail_recursion() to calculate the factorial of n using tail recursion, where an additional parameter, accumulator, keeps track of the running product.
Inside the function, we check if n is 0. If it is, we return the accumulator, which holds the final factorial result. This acts as the base case to stop the recursion.
If n is not 0, we make a tail-recursive call, reducing n by 1 and multiplying the accumulator by n. This approach avoids additional calculations after the recursive call, making it tail-recursive.

When we call the function with n = 5, the steps are as follows:
factorial_tail_recursion(5, 1) calls factorial_tail_recursion(4, 5)
factorial_tail_recursion(4, 5) calls factorial_tail_recursion(3, 20)
factorial_tail_recursion(3, 20) calls factorial_tail_recursion(2, 60)
factorial_tail_recursion(2, 60) calls factorial_tail_recursion(1, 120)
factorial_tail_recursion(1, 120) calls factorial_tail_recursion(0, 120)

When n becomes 0, the recursion stops, and the function returns 120.
Finally, we print the result, showing "Factorial of 5 is: 120".

Alternative Approaches To Mitigate Stack Overflow

Convert Recursion to Iteration: Use loops instead of recursion for problems prone to stack overflow.

def factorial_iterative(n):
result = 1
for i in range(1, n + 1):
result *= i
return result

Manually Manage the Stack: Simulate the recursion stack using a data structure like a list.
Use a Different Language: Consider programming languages with native support for tail-call optimization (e.g., Scheme, Scala).

Infinite Recursion In Python

Infinite recursion occurs when a recursive function repeatedly calls itself without ever reaching a base case or halting condition. This results in an infinite series of function calls, eventually leading to a RecursionError in Python because the recursion depth exceeds the allowable limit (default: 1000).

Syntax Of Infinite Recursion In Python:

def function_name(parameters):
# Missing or incorrect base case
return function_name(parameters) # Recursive call without halting

How To Identify Infinite Recursion?

Check for Missing or Incorrect Base Case: Ensure that your function has a base case, and verify that the base case condition is reachable. For example:

Correct Base Case: if n == 0: return 1
Incorrect Base Case: if n < 0: return 1 (may never trigger).

Inspect Recursive Calls: Confirm that the function parameters progress toward the base case in every recursive call. Example: n - 1 should eventually lead to the base case (n == 0).
Trace Function Execution: Use print statements or a debugger to observe how parameters change with each recursive call. Infinite recursion is indicated if parameters don’t approach the base case or repeat endlessly.

Code Example:

ZGVmIGluZmluaXRlX3JlY3Vyc2lvbihuKToKICAgICMgTWlzc2luZyBiYXNlIGNhc2UKICAgIHByaW50KCJDdXJyZW50IHZhbHVlOiIsIG4pCiAgICByZXR1cm4gaW5maW5pdGVfcmVjdXJzaW9uKG4gLSAxKSAgIyBSZWN1cnNpdmUgY2FsbCB3aXRob3V0IHN0b3BwaW5nIGNvbmRpdGlvbgoKIyBUZXN0aW5nIHRoZSBmdW5jdGlvbgppbmZpbml0ZV9yZWN1cnNpb24oNSkK

Output:

Current value: 5
Current value: 4
Current value: 3
Current value: 2
Current value: 1
...
RecursionError: maximum recursion depth exceeded while calling a Python object

Explanation:

In the above code example-

We define a function infinite_recursion() that takes a parameter n and prints its current value.
Inside the function, we call itself recursively with n - 1 as the argument.
Since there is no base case to stop the recursion, the function continues to call itself indefinitely.
When we test the function with n set to 5, the recursion begins:

infinite_recursion(5) calls infinite_recursion(4)
infinite_recursion(4) calls infinite_recursion(3)
This pattern continues without end.

Eventually, the program crashes due to a stack overflow, as the recursive calls consume all available memory without stopping.

Searching for someone to answer your programming-related queries? Find the perfect mentor here.

Advantages Of Recursion In Python

Simplifies Complex Problems: Recursion can simplify problems that have a repetitive structure, such as tree or graph traversal. It breaks down problems into smaller, manageable sub-problems. Example: Traversing a binary tree is naturally recursive, as each subtree can be processed in the same way as the original tree.
Elegant and Concise Code: Recursive solutions are often shorter and more intuitive compared to their iterative counterparts, making the code easier to understand. Example: A recursive solution to factorial calculation is compact and easy to write compared to an iterative solution.
Natural Fit for Divide-and-Conquer Algorithms: Algorithms like merge sort, quick sort, and binary search are naturally recursive and lend themselves well to recursive implementation. Example: Merge sort divides the problem into two halves and recursively sorts them.
Reduces the Need for Extra Data Structures: Recursion can eliminate the need for complex auxiliary data structures, such as stacks or queues, as the function call stack inherently holds the intermediate states. Example: In depth-first search (DFS), recursion inherently handles the stack of nodes.
Improves Code Readability in Certain Cases: In some cases, recursion provides a clearer and more natural solution to a problem, which can be more readable and maintainable than complex loops. Example: Recursion in computing Fibonacci numbers is straightforward and often easier to understand than an iterative solution.

Disadvantages Of Recursion In Python

Risk of Stack Overflow: Python has a limited recursion depth (default is 1000). Deep recursion can quickly exhaust the call stack, leading to a stack overflow. This is particularly problematic for problems with large inputs. Example: Computing the factorial of a very large number recursively might exceed the recursion limit.
Increased Memory Usage: Each recursive call adds a new stack frame to the call stack, increasing memory usage. This can be inefficient for problems that involve a large number of recursive calls. Example: Recursion in calculating the Fibonacci sequence without memoization can lead to significant memory overhead.
Performance Overhead: Recursive function calls generally have more overhead than loops due to the function call stack management. This can make recursive solutions slower compared to iterative solutions. Example: Recursive calls in the Fibonacci series without memoization result in a lot of redundant calculations, leading to poor performance.
Difficult to Debug: Debugging recursive functions can be challenging because the flow of execution is less predictable compared to iterative code. Tracking the values through each recursive call can also be difficult. Example: Understanding the flow of recursive calls in a complex tree traversal algorithm can be confusing.
Not Always the Most Efficient Solution: While recursion works well for certain problems, it is not always the most efficient. Iterative solutions may be more suitable for problems that do not inherently have a recursive structure. Example: Iterative approaches for problems like summing elements of a list can be simpler and more efficient than recursion.
Python’s Lack of Tail-Call Optimization: Python does not support tail-call optimization. This means that tail-recursive functions (which should theoretically not consume extra stack space) will still use additional stack frames. In languages with tail-call optimization, this would not be an issue. Example: A tail-recursive function for calculating factorials still consumes extra memory in Python due to the lack of tail-call optimization.

Best Practices For Using Recursion In Python

Recursion can be a powerful tool when used appropriately, but it also comes with its own set of challenges, particularly with Python's lack of tail-call optimization. Here are some best practices to follow when using recursion in Python:

1. Ensure a Proper Base Case

Always define a base case that will stop the recursion. Without it, the function will continue calling itself indefinitely, leading to a stack overflow.
Example: A base case in a factorial function ensures the recursion ends when n == 0.

def factorial(n):
if n == 0: # Base case
return 1
return n * factorial(n - 1)

2. Reduce the Problem Size

In each recursive call, make sure the problem size reduces toward the base case. This ensures that the recursion progresses and doesn’t get stuck.
Example: Decreasing n by 1 in the factorial example moves towards the base case.

return factorial(n - 1) # Problem size is reduced

3. Avoid Deep Recursion

Python has a recursion limit (default is 1000), and deep recursion may lead to a stack overflow. Consider using iteration or other techniques like explicit stacks if the problem involves many recursive calls.
Alternative: Convert recursive functions to iterative ones where possible, especially for tasks like calculating factorials or summing elements.

4. Use Tail Recursion Where Possible

Tail recursion can optimize memory usage by eliminating the need for additional stack frames. However, Python does not support tail-call optimization natively.
Alternative: Use loops or manual stack management for better memory efficiency in deep recursions.

5. Use Recursion for Naturally Recursive Problems

Recursion works best for problems that can be broken into smaller sub-problems of the same type, such as:

Tree and graph traversal
Searching algorithms (e.g., binary search)
Divide-and-conquer algorithms (e.g., merge sort, quicksort)

Example: In tree traversal, recursion is a natural fit.

6. Avoid Unnecessary Computations

In some cases, recursion can cause the same computation to be repeated multiple times. You can use memoization to store previously computed results and avoid redundant calculations.
Example: Fibonacci sequence can be computed more efficiently using a cache.

7. Test for Stack Overflow

Before running a recursive function with large input, test its depth to ensure it won't cause a stack overflow. You can use sys.getrecursionlimit() to check and adjust the recursion limit if necessary.
Example: Increase recursion limit for deep recursions (with caution).

import sys
sys.setrecursionlimit(1500) # Increase recursion depth limit if necessary

8. Document Recursion Logic Clearly

Clearly explain the base case, recursive case, and how each recursive call reduces the problem size. Recursion can be tricky to debug, so good documentation and clear function definitions will help maintain the code.
Example: Comment on the purpose of each part of the recursive function.

9. Use Recursion Sparingly

While recursion is a valuable tool, overuse or unnecessary use can lead to code that is hard to understand and debug. Use recursion only when it naturally fits the problem or when it provides clear advantages over iterative solutions.

Conclusion

Recursion in Python is a powerful tool that simplifies complex problems by breaking them into smaller, more manageable sub-problems. It shines in scenarios like tree traversal, divide-and-conquer algorithms, and inherently repetitive tasks. However, Python's lack of tail-call optimization and the risk of stack overflow mean that recursion must be used judiciously. By adhering to best practices—such as defining clear base cases, reducing problem size effectively, and employing techniques like memoization—you can harness the benefits of recursion while minimizing its pitfalls. Ultimately, recursion complements iteration, and choosing between the two depends on the problem's nature, performance requirements, and the clarity of implementation.

Frequently Asked Questions

Q. What is recursion, and how does it work in Python?

Recursion is a technique in programming where a function calls itself to solve smaller instances of a problem. In Python, this is achieved by defining a base case to stop the recursion and a recursive case to break the problem into smaller parts. Each recursive call is added to the call stack, and Python processes these calls in a "last-in, first-out" manner until the base case is met.

Q. What is the importance of a base case in recursion?

The base case in recursion is crucial as it acts as the stopping condition for the recursive calls, preventing infinite loops and ensuring that the recursion eventually terminates. Without a well-defined base case, a recursive function would continue calling itself indefinitely, leading to a stack overflow error due to the exhaustion of memory allocated for the call stack. The base case also provides the solution to the simplest instance of the problem, allowing the recursive process to unwind and combine results from smaller subproblems to solve the larger problem. Essentially, it is the foundation upon which the entire recursive logic relies.For example, in calculating the factorial of a number, the base case is typically when the number equals zero (n == 0).

Q. What are the limitations of recursion in Python?

Recursion in Python, while powerful, has several limitations:

One of the primary limitations is the risk of stack overflow, especially when the recursion depth becomes too large. Python has a default recursion limit (usually 1000), and exceeding this limit results in a RecursionError. This happens because each recursive call consumes memory on the call stack, and if the recursion is too deep, the program will run out of memory.
Another limitation is performance overhead, as recursive functions can be slower than their iterative counterparts due to the repeated function calls and the overhead of managing the call stack.
Additionally, recursive solutions are often less memory-efficient, as they require maintaining a separate function call for each step. These limitations make recursion less suitable for problems that involve deep recursion or require optimal performance.

Q. How can we optimize recursive functions in Python?

You can optimize recursive functions using:

Memoization: Store previously computed results to avoid redundant calculations (e.g., using functools.lru_cache).
Dynamic Programming: Break the problem into subproblems and solve each one only once.
Converting to Iterative Solutions: Use loops for problems with large input sizes to prevent stack overflow.

Q. What are some real-life examples where recursion is useful?

Recursion is particularly useful in problems with a hierarchical or repetitive structure. Examples include:

Tree Traversals: Navigating nodes in a binary or general tree.
Divide-and-Conquer Algorithms: Merge sort, quick sort, and binary search.
Solving Mathematical Problems: Calculating factorials, Fibonacci sequences, or powers.
Graph Traversals: Depth-first search (DFS).

Q. Why does Python lack native tail-call optimization, and how can we mitigate it?

Python does not implement tail-call optimization to keep its stack trace clear for debugging purposes. Tail-call optimization reduces memory usage by reusing the current stack frame for a tail-recursive function. To mitigate Python’s lack of this feature, you can:

Use iteration instead of recursion for tail-recursive problems.
Simulate a stack manually to handle deep recursion.

Q. How does recursion compare to iteration in Python?

While both recursion and iteration are used to repeat tasks, recursion often provides a more natural and elegant solution for problems like tree traversals or divide-and-conquer algorithms. Iteration, on the other hand, is more memory-efficient for large input sizes since it does not consume stack space. Choosing between recursion and iteration depends on the problem's structure, performance requirements, and readability considerations.

With this, we conclude our discussion on the topic of recursion in Python. Here are a few other topics that you might want to read:

Edited by

Muskaan Mishra

Technical Content Editor

I’m a Computer Science graduate with a knack for creative ventures. Through content at Unstop, I am trying to simplify complex tech concepts and make them fun. When I’m not decoding tech jargon, you’ll find me indulging in great food and then burning it out at the gym.

Tags:

Python programming language