Drdo 2008

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 fo...

Arjun

889 views

Arjun asked Feb 16

Algorithms
gate-ds-ai-2024
algorithms
binary-search

+ –

4 votes

2 answers

GO Classes asked Feb 5

501 views

GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 18
Bob writes down a number between 1 and 1,000. Mary must identify that number by asking "yes/no" questions of Bob. Mary knows that Bob always tells the truth. If Mary uses an optimal strategy then she will determine that answer at the end of exactly how many questions on the worst case? 999 500 32 10

Bob writes down a number between 1 and 1,000. Mary must identify that number by asking "yes/no" questions of Bob. Mary knows that Bob always tells the truth. If Mary uses...

GO Classes

501 views

GO Classes asked Feb 5

Algorithms
goclasses2024-mockgate-14
algorithms
binary-search
1-mark

+ –

1 votes

0 answers

GO Classes asked Feb 4

178 views

Memory Based GATE DA 2024 | Question: 19
Consider the function $f(n)$, which represents the maximum number of comparisons in binary search on a sorted array of size $n$. Which of the following recursive relationships correctly defines $f(n)$? $f(n) = f\left(\lfloor \frac{n}{2} \rfloor\right) ... \rfloor\right)$ $f(n) = f\left(\lfloor \frac{n}{2} \rfloor\right) + 1$ None of the above

Consider the function $f(n)$, which represents the maximum number of comparisons in binary search on a sorted array of size $n$. Which of the following recursive rela...

GO Classes

178 views

GO Classes asked Feb 4

Algorithms
gate2024-da-memory-based
goclasses
algorithms
binary-search
recurrence-relation

+ –

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

0 reply

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

2 2 Comments reply

Please log in or register to add a comment.

Related questions

0

2 2 Comments