Count binary search steps for specific keys

Q: Count binary search steps for specific keys

This is a Software Engineering Fundamentals interview question from Bitkernel for Software Engineer roles. View the full question and solution on PracHub.

Q: How do I approach Software Engineering Fundamentals interview questions?

Software Engineering Fundamentals questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master software engineering fundamentals interviews.

Question

You have the sorted array:

[22, 34, 55, 77, 89, 93, 99, 102, 120, 140]

Using standard binary search with low and high indices and mid = floor((low + high) / 2), how many comparisons are required to find each of the following keys: 77, 34, and 99?

Provide the triple (comparisons for 77, comparisons for 34, comparisons for 99).

Options:

A. 3, 3, 3
B. 3, 3, 4
C. 3, 4, 3
D. 4, 2, 4

Count binary search steps for specific keys

Solution

Comments (0)