Login
Remember
Register
Certificationglobe
Questions
Unanswered
Users
Ask a Question
Ask a Question
A sorted file contains 16 items. Using binary search, the maximum number of comparisons to search for an item in this file is ...........?
0
votes
asked
Feb 15
by
Mark Pearson
(
195k
points)
Que.
A sorted file contains 16 items. Using binary search, the maximum number of comparisons to search for an item in this file is ...........
a.
15
b.
8
c.
1
d.
4
Please
log in
or
register
to answer this question.
1
Answer
0
votes
answered
Feb 15
by
Raelynn
(
407k
points)
Answer: 4
Please
log in
or
register
to add a comment.
10.2k
questions
10.2k
answers
0
comments
3
users
Related questions
0
votes
1
answer
At most, how many comparisons are required to search a sorted vector of 1023 elements using the binary search algorithm?
asked
Jan 29
by
Mark Pearson
(
195k
points)
0
votes
1
answer
Disadvantage of using array representation for binary trees is?Que. Disadvantage of using array representation for binary trees is? a. difficulty in knowing children nodes of a node b. difficult in finding the parent of a node c. have to know the maximum number of nodes possible before creation of trees d. difficult to implement?
asked
Jan 20
by
Mark Pearson
(
195k
points)
0
votes
1
answer
State True or False. i) Binary search is used for searching in a sorted array. ii) The time complexity of binary search is O(logn).?
asked
Jan 23
by
Mark Pearson
(
195k
points)
0
votes
1
answer
Que. State True or False. i) Binary search is used for searching in a sorted array. ii) The time complexity of binary search is O(logn).?
asked
Jan 22
by
Mark Pearson
(
195k
points)
0
votes
1
answer
In binary search, average number of comparison required for searching an element in a list if n numbers is?
asked
Feb 2
by
Mark Pearson
(
195k
points)
...