## Java Fibonacci Number Generator

Before starting coding our Java Fibonacci number generator let’s recap what it is. Fibonacci series are made out of terms defined as: a1 = 1; a2 = 2; a3 = a1 + a2; ………………… an = an-2 + an-1   Java code: Output: 1 1 2 3 5 8 13 21 34 55 89 144 … Read more

## Java – Convert to any base (Binary, Octal, Hex)

Converting between decimal and an arbitrary base x is done by evenly dividing the decimal number to the base x until the division quotient is zero.   Example: converting 23 (decimal) to binary (base 2): 23 / 2 = 11, remainder 1 11 / 2 = 5, remainder 1 5 / 2 = 2, remainder 1 2 / 2 … Read more

## Java – Check if number is prime

To check if a number is prime means generating all natural numbers greater or equal to 2 and smaller or equal to the square root of the number we want to check. Then we verify if one of these numbers can evenly divide the number we want to check. If this is true, then the … Read more

## Java – Least common multiple

Finding the least common multiple out of two numbers is done using the greatest common divisor. Exemple: Number 27 and 36. Their greatest common divisor (the largest number that can divide both evenly) is 9. 27 / 9 = 3 and 36 / 9 = 4. So the least common multiple (smallest number that can … Read more

## Java – Insertion Sort Algorithm

For this method we need two arrays: source and destination. Elements of the source array will be inserted in the corresponding position, so that in the destination array the order relation will be fulfilled.   Step 1: We copy the first element of the source array into the first position of the destination array. Step … Read more