In this case, students are semi-sorted age-wise, which makes the sorting inexpensive.Īt the same time, the bubble sort is capable of doing what other algorithms cannot do: since it goes through the whole unsorted part of the list, it can recognize when the list is sorted and stop. However, it can handle even large pools of data which are already semi-sorted, such as lists of students from different years that are enrolled in a variety of courses.

Therefore, it cannot handle large and significantly unsorted data sets. In Computer and Data Science, the bubble sort is considered to be a beginner algorithm and an inefficient and wasteful sorting method, because it swaps items before it achieves the final result, which is quite costly. Where the list is an array of elements, and the swap function is responsible for swapping the elements that are out of order. The high-level algorithm can be described, as follows: Afterwards, the algorithm repeats this process until it reaches the end of the string and finds no pair of elements that are out of order. This approach examines each pair of adjacent elements from left to right, checking if they are in the correct - ascending or descending - order, and switches their positions if the order is wrong. Bubble sort is a basic sorting algorithm that arranges a string of elements by repeatedly comparing and swapping adjacent elements until all elements are in the correct order.