The analysis for the number of visits in a binary search begins with the equation, T(n) = T(n / 2) + 1. What does the number 1 represent in this equation?
A) One element visit before a recursive call on one half of the array.
B) The total number of recursions required.
C) The fact that the number of elements is odd.
D) The fact that we search either the left half or the right half, but not both.

Question

Quizplus · Accepted Answer

The number 1 represents the visit to the middle element of the array before deciding which half to recursively search.

The Analysis for the Number of Visits in a Binary