The pseudocode below describes the binary search algorithm. Use the pseudocode to write a C++ program that implements and tests the binary search algorithm. Note: YOU MUST FOLLOW THE STEPS IN THE GIVEN PSEUDOCODE. DO NOT USE ALTERNATIVE ALGORITHMS. Pseudocode: The Binary Search Algorithm 1 procedure binary search (x: integer, a,a2,... ,an: - increasing integers) 2 i := 1{i is left endpoint of search interval} 3 j:= n (j is right endpoint of search interval) while i am then i := m + 1 else j := m 5 6. 7 if x=a; then location := i else location := 0 return location {location is the subscript i of the term a; equal to x, or 0 if x is not found} 8 10 11
The pseudocode below describes the binary search algorithm. Use the pseudocode to write a C++ program that implements and tests the binary search algorithm. Note: YOU MUST FOLLOW THE STEPS IN THE GIVEN PSEUDOCODE. DO NOT USE ALTERNATIVE ALGORITHMS. Pseudocode: The Binary Search Algorithm 1 procedure binary search (x: integer, a,a2,... ,an: - increasing integers) 2 i := 1{i is left endpoint of search interval} 3 j:= n (j is right endpoint of search interval) while i am then i := m + 1 else j := m 5 6. 7 if x=a; then location := i else location := 0 return location {location is the subscript i of the term a; equal to x, or 0 if x is not found} 8 10 11
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Please help
![The pseudocode below describes the binary search algorithm. Use the pseudocode to
write a C++ program that implements and tests the binary search algorithm.
Note: YOU MUST FOLLOW THE STEPS IN THE GIVEN PSEUDOCODE. DO NOT
USE ALTERNATIVE ALGORITHMS.
Pseudocode: The Binary Search Algorithm
1 procedure binary search (x: integer, a1,a2,...,an: increasing integers)
2 i:= 1{i is left endpoint of search interval}
3 j:= n {j is right endpoint of search interval}
4 while i < j
m := [(i+j)/2]
6.
if x>am then i := m + 1
else j := m
if x=a; then location := i
else location := 0
7
8.
9.
return loc ation {location is the subscript i of the term a equal to x,
11 or 0 if x is not found)
10](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fbbd48dd4-2dee-400d-8deb-40e5bd5726ec%2F4c37c82c-65fc-4d0f-a45a-3c45749d6d5e%2Fxu8gsid_processed.jpeg&w=3840&q=75)
Transcribed Image Text:The pseudocode below describes the binary search algorithm. Use the pseudocode to
write a C++ program that implements and tests the binary search algorithm.
Note: YOU MUST FOLLOW THE STEPS IN THE GIVEN PSEUDOCODE. DO NOT
USE ALTERNATIVE ALGORITHMS.
Pseudocode: The Binary Search Algorithm
1 procedure binary search (x: integer, a1,a2,...,an: increasing integers)
2 i:= 1{i is left endpoint of search interval}
3 j:= n {j is right endpoint of search interval}
4 while i < j
m := [(i+j)/2]
6.
if x>am then i := m + 1
else j := m
if x=a; then location := i
else location := 0
7
8.
9.
return loc ation {location is the subscript i of the term a equal to x,
11 or 0 if x is not found)
10
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 5 images
Knowledge Booster
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.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education