Think about how you search a dictionary: you start in the middle either go left or go right until you find the word you’re looking for or can’t narrow the word list down any further. It’s possible to do the same in a list of numbers. Write an algorithm that, given a list of numbers and a secret number to find, tells you where in the list (index) you can find that number or tells you the number isn’t in the list.

C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter18: Stacks And Queues
Section: Chapter Questions
Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...
icon
Related questions
Question
Think about how you search a dictionary: you start in the
middle either go left or go right until you find the word you’re looking for
or can’t narrow the word list down any further. It’s possible to do the
same in a list of numbers. Write an algorithm that, given a list of numbers
and a secret number to find, tells you where in the list (index) you can
find that number or tells you the number isn’t in the list.
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Time complexity
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning