Question:medium

Let F(n) denote the maximum number of comparisons made while searching for an entry in a sorted array of size n using binary search.
Which ONE of the following options is TRUE ?

Updated On: Nov 25, 2025
  • F(n) = F(⌊n/2⌋) + 1
  • F(n) = F(⌊n/2⌋) + F(⌈n/2⌉)
  • F(n) = F(⌊n/2⌋)
  • F(n) = F(n - 1) + 1
Hide Solution

The Correct Option is A

Solution and Explanation

Option (A) is correct: F(n) = F(⌊n/2⌋) + 1.
Was this answer helpful?
0


Questions Asked in GATE AR exam