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