Multiple ChoiceIntermediate 30s
Merge Sort
Merge sort is a divide-and-conquer algorithm with time complexity:
Options
- 1O(n log n)
- 2O(n²)
- 3O(n)
- 4O(log n)
Think you can answer under pressure?
Get matched and answer live questions in 3-minute 1v1 battles. Elo ranking, badge tiers and bragging rights on the line.