GATE | DA | 2024 | Algorithm | Recurrence | Question 16

Last Updated :
Discuss
Comments

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

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

This question is part of this quiz :

GATE DA 2024,GATE DA Programming, Data structure and Algorithms Quiz
Tags:
GATE
Algorithms
Share your thoughts in the comments