Practice
Learn
← Quit
0 / 0 correct
Algorithms
Easy
1 of 10
What is required for binary search, and what is its time complexity?
A
Unsorted data, O(log n)
B
A hash table, O(1)
C
Sorted (or monotonic) data, O(log n)
D
Sorted data, O(n)