A searching algorithm that's O(1)________.
A)requires one comparison
B)does not necessarily require only one comparison
C)can search only an array of one item.
D)None of the above.

Question

Quizplus · Accepted Answer

O(1) indicates constant time complexity, meaning the time to complete the search does not depend on the size of the data set. It does not necessarily mean only one comparison is made.

A Searching Algorithm That's O(1)________