← Back to Computer Science
Algorithms quiz
Five questions on Algorithms. Answer all 5 to see your score. Questions are drawn from a bank of 15, so every attempt is different.
Question 1 of 5
Linear search on a list of n items may need up to:
Question 2 of 5
Binary search on a sorted list of about a million items needs at most about:
Question 3 of 5
Which sorting algorithm repeatedly inserts each item into a sorted section?
Question 4 of 5
Merge sort's running time is:
Question 5 of 5
Quicksort can degrade to O(n^2) when: