← All practice quizzes🎯 Today’s placement challenge — 10 questions, no login. Can you score 10/10?24 students have taken today’s challengeTake today’s challenge →
Quiz: Merge Sort and Quick Sort
5 questions · new set on every retakeNo time limitPass: 60%+10 XP on first pass
How merge sort and quick sort reach O(n log n), traced with diagrams; the merge step, Lomuto partition, the worst case of quick sort and how to avoid it, with Python and Java code.
Log in to take the quiz
Free account · see your score, answers and explanations, earn XP