Blog

The complexity of algorithms is usually estimated by the execution time or by the memory used. Asymptotic complexity is the complexity as the size of the input tends to infinity. The difficulty is usually described with the letter O. Examples: O(1) – Constant Time Algorithms O(n) – Linear Time Algorithms O(log n) – Logarithmic Time […]

1. Debug a “Bubble Sort” program 1. Create a table for any array, in which to sequentially write the values ​​of i, j, array for each cycle of the bubble sort algorithm. 2. Use the debugger. 3. For example, for the array 0 2 5 3 4:  i   j    Array values     Is the […]

A fairly common task is to find an element in an array. Let’s say we have an array 1,5,8,10,16,20… 100 and we need to find the position of element 10 in it. Or even find out if there is such an element in the array. There are the following algorithms to solve this problem: Linear […]

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 […]