Blog

Here is another sorting option “Selection sorting”. The idea of ​​the algorithm is that we are looking for the minimum element in the array and swapping it with the element in position zero. Next, look for the next largest element and swap it with the element at index 1, and so on: Consider the implementation […]

Let’s take a look at the bubble sort. Bubble sort is a sorting algorithm that is widely used for students’ education and it has many modifications. The idea behind bubble sort is that the sorting step is to traverse the array from bottom to top. Pairs of neighboring elements are looked through along the way. […]

There is an array {1, 2, 3, 4} and it needs to be expanded (or inverted) to get an array {4, 3, 2, 1}. We find the middle of the array – array.length / 2. Iterate over the elements of the array from the beginning to the middle and simultaneously swap the elements with index […]

Often in the process of solving a particular problem, two variables must exchange values. There are two options for implementing value exchange: Option 1: Swap Values ​​Using a Temporary Variable We introduce a temporary variable that will temporarily hold the value from one variable: int tmp = a; a = b; b = tmp; For […]

Consider the implementation of the algorithm for finding the arithmetic mean of the array elements. First, in a loop, we will iterate over all the elements of the array and calculate their sum. Then we divide the sum by the length of the array: public class ArithmeticAverage { public static void main(String[] args) { double[] […]

Fibonacci numbers – elements of the numerical sequence 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, …, in which the first two numbers are either 1 and 1, or 0 and 1, and each subsequent number are equal to the sum of […]