In Bubble Sort, we can terminate the algorithm if no swaps are made in a pass.

In Bubble Sort, we compare adjacent pairs of elements and swap them if they are in the order.

Bubble sort is an example of a sorting algorithm.

The algorithm repeatedly swaps adjacent elements if they are in the wrong order.