Algorytmy

Let’s say we have array[] that consists of n elements.
And now our task is to write a method that will find the element selected by us in this array.

Powiedzmy, że mamy tablicę array[] która składa się z n elementów.
I teraz naszym zadaniem jest napisać metodę, która znajdzie wybrany przez Nas element w tej tablicy.

The selection sort algorithm sorts an array by repeatedly finding the minimum element from unsorted part and putting it at the beginning.

Bubble sort is the simplest sorting algorithm that works by repeatedly replacing adjacent items if they are in the wrong order.

Insertion sort is a simple sort algorithm
that works similar to the way playing cards sort.