Bubble Sort

Bubble sort is a basic sorting algorithm that repeatedly compares and swaps adjacent elements until the list is sorted. Although easy to implement, it is inefficient for large datasets with a time complexity of O(n^2). It is stable, meaning it preserves the order of equal elements.