contrast bubble sort and merge sort 

• Bubble Sort is a simple, in-place, comparison-based algorithm with O(n^2) time complexity, making it less efficient for large datasets but easy to implement and understand. It is stable and has O(1) space complexity.

• Merge Sort is a more efficient, divide-and-conquer algorithm with O(n log n) time complexity, making it suitable for larger datasets. It requires O(n) additional space and is stable, ensuring that the relative order of equal elements is preserved.

Overall, Merge Sort is preferred for performance and efficiency in practical applications, while Bubble Sort is more of a teaching tool due to its simplicity.