Skip to content

Home Explore My library My quizzes Earnings

Home Explore My library My quizzes Earnings Settings

Quiz

💻

Computer scienceSample content

Big-O Quick Check

by Mia Brooks

Try this quiz now

Choose one answer for each question. No account is needed.

Question 1 of 3Binary search on a sorted array runs in…O(n)O(log n)O(n log n)O(1)
Question 2 of 3Average-case lookup in a hash table is…O(1)O(n)O(log n)O(n²)
Question 3 of 3Merge sort's worst-case time complexity is…O(n²)O(n log n)O(n)O(log n)

Unanswered questions count as incorrect. No account is needed.

About this quiz

Compare the time complexity of common operations and algorithms in a few quick questions.

3 multiple-choice questions
Instant results with explanations after you submit
Retake as often as you like