recursion - OpenGenus IQ: Learn Algorithms, DL, System Design

Sum of N natural numbers using recursion

In this article, we have explained how to get the sum of N natural numbers using recursion and implement the technique in C Programming Language.

recursion

Static and Global Variables in Recursion

In this article, we are going to see how recursion uses Static and Global Variables with the help of examples.

recursion

Non-Tail Recursion

In this article, we will be in depth discussing about Non-Tail Recursion. The basic algorithm, its time complexity, space complexity, advantages and disadvantages of using a non-tail recursive function in a code.

Java

Recursion in Java

This article will dive into the basic introduction to recursion, and how it is implemented in Java.

Algorithms

Data Structure used for Recursion

In this article, we will explore stack and its properties and operation, then we will cover recursion and explain why stack is used for recursion, finally we will discuss how to convert recursive to iterative approach.

recursion

Print all combinations of factors

In this article, we will discuss about the algorithms to print every combination of factors of a given number (all factorization). We have explored recursive and partially iterative approach.

String Algorithms

Find permutations of string in lexicographic order

In this article, we have presented an algorithm to Find permutations of string in lexicographic order. We have used the concept of Recursion.

Algorithms

Tail Recursion

In this article, we have explored the idea of Tail Recursion in depth with several code examples along with comparison with Non-Tail Recursion.

Algorithms

Letter Combinations of a Phone Number

In this article, we have discussed two approaches (recursive + iterative) to solve the problem "Letter Combinations of a Phone Number" in C++ language with explanation of Time and Space complexity.

Algorithms

Number of ways to represent a number N as sum of K Fibonacci terms

The problem we will solve is that given a number N and K, we need to find the numbers of ways we can represent N as a sum of K fibonacci numbers. We will solve this problem efficiently using a recursive technique in O(N).

Software Engineering

An in-depth look into Recursion in C

Recursion is a coding technique/ design in which a function calls itself directly or indirectly and the corresponding function is called as recursive function. Using this many problems can be solved easily with less time. C, C++, Java, Python, Go and others support Recursion except Fortan 77