Answers
Breaks down array into smallest units then merges
Divide-and-conquer approach
Performs well on small or nearly sorted arrays
Efficient for large datasets
Simple but not efficient for large datasets
Worst-case time complexity of O(n^2)
Repeatedly compares adjacent elements and swaps them
Requires additional space for merging
Continues until no swaps needed
Time complexity of O(n log n)
