Quiz · 4 questions

🔍 Searching & Sorting

The two operations everything else is built on

Level 0Curious Beginner

0 XP0/85 lessons0/19 achievements

0/100 XP to next level100 XP to go0% complete

01Binary search achieves O(log n) by...

02Merge sort is O(n log n) because it...

03Quicksort's complexity is...

04Why is O(n log n) the speed limit for comparison-based sorting?

Hint

How many distinct orderings must a sort tell apart, and how many yes/no questions does that take?

Spotted a bug or have feedback on this page?Report an Issue

Comments 0

No comments yet — be the first.