The ____ search algorithm is O(log n).
A) binary
B) linear
C) recursive
D) iterative

Name: The ____ search algorithm is O(log n). A) binary B) linear C) recursive D) iterative
Brand: Quizplus
Rating: 4.7 (31 reviews)

Question

Quizplus · Accepted Answer

The binary search algorithm has O(log n) time complexity, which is more efficient than linear or recursive search algorithms. Iterative search is not a specific type of algorithm and can refer to both linear and binary search, so it cannot be considered the best choice.

The ____ Search Algorithm Is O(log N)