recursion - OpenGenus IQ: Computing Expertise & Legacy

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