Bubble Sort

Bubble sort is the simplest and slowest algorithm used for sorting. It is designed in a way that the highest value in its list bubbles its way to the top as the algorithm loops through iterations. As its worst-case performance is O(N²), as discussed previously, it should be used for smaller datasets.