_________ is a sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.

Bubble Sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order. It continues to do so until the list is sorted. Despite its simplicity, Bubble Sort is inefficient for large lists and is mainly used for educational purposes or for sorting small datasets. Other sorting algorithms like Merge Sort and Quick Sort offer better performance for larger datasets.