Virtual Labs

What is the primary strategy used in Merge Sort?

Divide-and-Conquer
Recursion
Comparison-based
Swapping adjacent elements

What is the time complexity of Merge Sort in the worst case?

O(n)
O(n²)
O(log n)
O(n log n)

What is the primary disadvantage of Merge Sort?

It is not stable
It requires additional memory
It is inefficient for small datasets
It has a high time complexity

What happens during the merge process in Merge Sort?

Subarrays are sorted and combined
Elements are swapped within subarrays
The largest element is placed in the correct position
No comparisons are made

What is the space complexity of Merge Sort?

O(n)
O(1)
O(n log n)
O(log n)

Merge Sort