Home
Recent Q&A
Java
Cloud
JavaScript
Python
SQL
PHP
HTML
C++
Data Science
DBMS
Devops
Hadoop
Machine Learning
Azure
Blockchain
Devops
Ask a Question
In general, the binary search method needs no more than ……………. comparisons.
Home
Data Structures & Algorithms
In general, the binary search method needs no more than ……………. comparisons.
0
votes
asked
Dec 8, 2022
in
Data Structures & Algorithms
by
sharadyadav1986
In general, the binary search method needs no more than ……………. comparisons.
a) [log2n]-1
b) [logn]+1
c) [log2n]
d) [log2n]+1
binay-search
Please
log in
or
register
to answer this question.
1
Answer
0
votes
answered
Dec 8, 2022
by
sharadyadav1986
d) [log2n]+1
Your comment on this answer:
Email me at this address if a comment is added after mine:
Email me if a comment is added after mine
Privacy: Your email address will only be used for sending these notifications.
Related questions
0
votes
Q: The number of comparisons done by sequential search is ………………
asked
Dec 8, 2022
in
Data Structures & Algorithms
by
Robin
sequential-search
+1
vote
Q: A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……
asked
Dec 6, 2022
in
Data Structures & Algorithms
by
sharadyadav1986
binary-search
+1
vote
Q: Write a method to decide if the given binary tree is a binary search tree or not.
asked
May 14, 2019
in
C Plus Plus
by
anonymous
0
votes
Q: A mixin with no parameter is more efficient than using extend
asked
Feb 22
in
HTML
by
DavidAnderson
html-interview-questions-answers
0
votes
Q: A mixin with no parameter is more efficient than using extend
asked
Feb 18
in
HTML
by
DavidAnderson
html5-interview-questions-answers
0
votes
Q: The property of binary tree is
asked
Dec 8, 2022
in
Data Structures & Algorithms
by
sharadyadav1986
binary-tree
0
votes
Q: What is the average case time complexity for finding the height of the binary tree?
asked
Oct 3, 2021
in
Data Structures & Algorithms
by
john ganales
data-structure
0
votes
Q: A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.
asked
Dec 8, 2022
in
Data Structures & Algorithms
by
Robin
grapg
0
votes
Q: What is the difference between a binary search and a sequential search?
asked
Dec 10, 2023
in
Cobol
by
sharadyadav1986
binarysearch
sequentialsearch
0
votes
Q: What is binary search?
asked
Dec 10, 2023
in
Cobol
by
sharadyadav1986
binarysearch
...