Question:

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: Jul 9, 2024
  • 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
collegedunia
Verified By Collegedunia

The Correct Option is A

Solution and Explanation

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