What is the average-case running time of binary search when searching a single-dimensional sorted array of size n? A) O( n ) B) O( log n ) C) O( 1 ) D) O( n² )

Name: What is the average-case running time of binary search when searching a single-dimensional sorted array of size n? A) O( n ) B) O( log n ) C) O( 1 ) D) O( n 2 )
Brand: Quizplus
Rating: 4.8 (40 reviews)

Question

Quizplus · Accepted Answer

Binary search repeatedly divides the search space in half, so its average-case running time is O(log n).

What Is the Average-Case Running Time of Binary Search When