braindrill

Sorting algorithms

6 practice questionsComputer ScienceStep-by-step solutions

Try a few

1

What is the average-case time complexity of merge sort?

A.O(n)
B.O(n log n)
C.O(n²)
D.O(log n)
🔒 Answer + full step-by-step solutionUnlock free →
2

What is the worst-case time complexity of merge sort?

A.O(n log n)
B.O(n²)
C.O(n)
D.O(log n)
🔒 Answer + full step-by-step solutionUnlock free →
3

What is the average-case time complexity of the merge sort algorithm?

A.O(n)
B.O(n log n)
C.O(n²)
D.O(log n)
🔒 Answer + full step-by-step solutionUnlock free →

Master sorting algorithmsnot just preview it

All 6 questions with worked solutions, an AI tutor that explains every step, and games that make the drilling stick. Free to start.

Practice this topic free

No card needed · 10 free AI questions daily