What is a kind of bubble?

Comparison of bubbles or sinking is an algorithm that sorts in order in the list for replacement and comparison of items. The process can take place several times before the list is in the correct order. Hidden its name from small elements, which are constantly rising to the top of the list, such as bubbles in the drink. Most often it is used to bring the order to small lists. It starts by comparing the first element with the second and switches them if necessary. It will then continue the list and re -make swap when it finds something out of service. Each time the algorithm performs a swap, the process will be re -launched from the top or bottom of the list.

types of bubbles are from the comparative group of sorting algorithms. This type of algorithm works two elements at a time and determines the pair of two, which is higher or if they are the same. This type of species can be a limited view of the data set, but can also facilitate the fine -tuning of the elements of this set. Other types of algorithms in the comparative group include fast, combEstate, cocktail and cycle paths.

It is assumed that another simple shifting algorithm called the advertising point works more efficiently while based on a similarly simple concept. Rather than items that are converted from above, they are inserted in the correct order in relation to each other until the entire set is properly ordered. In many cases, this species came to replace the bubble species both in educational curriculum and in common use.

Although the bubble sorting algorithm is easy to use and understand, it tends to be practical only for small lists. Speed ​​and efficiency decrease by increasing the number of items on the list. Many programmers are also difficult to use this relatively old method with newer -edited systems, as created before these more efficient machines existed.

There are some methods that can be used to increase the efficiency of a bubble sortingIn. The most effective seems to be a method where the algorithm works smoothly if the largest list elements are located at the beginning of the process. By having this base in place, it can take much fewer passages to appear the rest of the list. This way of ordering can be entered in the algorithm.