a) Bubble Sort
b) Merge Sort
c) Quick Sort
d) Selection Sort
For Explanation Click Here:
Merge Sort has a time complexity of O(n log n) in the best, average, and worst cases. This makes it more efficient than Bubble Sort (O(n^2)), Selection Sort (O(n^2)), and Quick Sort, which has an