Recursion in C++ is a function with a set of rules designed to reduce a problem into a smaller one called a base case. This may be referred to as the divide and conquer method since the idea is to solve a complex problem by solving the smaller instances of it. A classic example is Full Article…
Binary Search using recursion Binary search is a method to search through a sorted container in order to find a particular value. Remember that “Guess the number” game? Let’s look at the following scenario by applying the Binary Search Algorithm in order for you to understand how Binary Search works. The Guessing Game Pick a Full Article…
Finding the logarithm of a number given a base Below is an example of how to determine the logarithm of a number of base 2 and then of any base. The logarithm of a number using a given base is power to which the base must be raised to result in the number. This tutorial Full Article…
Determining if a string is a Palindrome using recursion Below is an example of how to determine if a word is a palindrome using recursion. A Palindrome is a string that could be read the same way in either direction such as racecar, mom, and even a. This tutorial expects you to understands the following. Full Article…
Greatest Common Divisor using the Euclidean Algorithm Below is an example of how to create the recursive function of computing the greatest common divisor using the Euclidean Algorithm. * This tutorial assumes you understand the following. Introduction to Recursion in C++ Euclid’s Algorithm When studying computer science a famous algorithm taught to students is the Full Article…
Creating a power function using Recursion So, previously we tried computing the Power function using recursion but we didn’t take into account when the exponent was negative. This continues the previous function, so if you haven’t yet, go back. Make sure you understand the following as well: C++ Recursion C++ Recursion – Summation C++ Recursion Full Article…
Creating a power function using Recursion Below is an example of how to calculate the x to the power of n. This tutorial expects you to understand the following: C++ Recursion C++ Recursion – Summation C++ Recursion – Factorial Example: 1 2 pow(2,3); pow(5,4); Result: 1 2 8 625 Iterative version of a function that Full Article…
