Bubble sorting is the simplest sorting algorithm used purely for educational purposes.
Practical application to this algorithm is not present, as it is not effective, especially if it is necessary to sort an array of a large size.
The advantages of sorting a bubble are the ease of implementing the algorithm.

The algorithm of sorting by a bubble is reduced to the repetition of passes through the elements of the array being sorted.
Passing through the elements of the array performs an inner loop. For each pass, two adjacent elements are compared, and if the order of the wrong elements is reversed.
The outer loop will work until the array is sorted.