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…
Viewing 1 to 4 of 4 items
C++ Recursion – Power Continued
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…
C++ Recursion – Power
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…
Project Euler – Mathematical/Computer Programming Related Questions
Project Euler provides you with a series of mathematical problems that require some computer programming skills to solve. It aims at making the user dive into new areas in order to learn new concepts for fun. Let’s take a look at their first problem. Find the sum of all the multiples of 3 or 5 Full Article…
