Best Case for Bubble Sort

Bubble Sort Overview

Bubble Sort is considered one of the simplest sorting algorithms that works by repeatedly swapping the adjacent elements if they are in the wrong order. With a bubble sort algorithm you will be able to see that the largest element (assuming we are sorting from smallest to largest) will “bubble” up to the top of the list or array.