Bubble Sort

Bubble Sort is a straightforward sorting algorithm that organizes a list by repeatedly stepping through the data, comparing adjacent elements, and swapping them if they are in the wrong order. This process continues until the entire list is sorted, with each pass through the data moving the largest unsorted element to its correct position. While Bubble Sort is easy to implement and understand, it is generally inefficient for large datasets compared to more advanced sorting algorithms.