Recursion is a powerful way of developing algorithms in which the solution of a problem is determined by the solution of one or more identical subproblems. A recursive solution involves two parts: at least one BASE CASE in which the solution returned is not dependent on any solution of any subproblem, and at least one RECURSIVE CASE, where… Read More »
In this article, you will learn to print the Fibonacci sequence of first n term. Fibonacci Series generates subsequent number by adding two previous numbers. The first two terms of the Fibonacci sequence are 0 followed by 1. The Fibonacci sequence: 0, 1, 1, 2, 3, 5, 8, 13, 21 … In mathematical terms, the sequence Fn of… Read More »
In this example, you will learn to reverse the given number using these two methods. Examples : Input : 123 Output : 321 Input : 1995 Output : 5991 Approach used : We can reverse a number in c using loop and arithmetic operators. Take input number Find its quotient and remainder. Multiply the separate variable with 10… Read More »
