Bubble & Merge Sort Algorithms

Bubble sort and merge sort are two sorting algorithms. Bubble sort compares and swaps adjacent elements until sorted, while merge sort uses a divide-and-conquer approach, recursively sorting sublists. Merge sort is more efficient than bubble sort, especially for larger datasets, as it operates in O(n log n) time compared to bubble sort's O(n²).