Write and execute a program that can read 16 numbers from keyboard and do the Binary search on them. procedure binary search(x: integer, a,a aa... a: increasing integers) n i := 1 {i is the left endpoint of interval} j:= n {j is right endpoint of interval} while i a then i:= m + 1 m else j:= m 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}
Write and execute a program that can read 16 numbers from keyboard and do the Binary search on them. procedure binary search(x: integer, a,a aa... a: increasing integers) n i := 1 {i is the left endpoint of interval} j:= n {j is right endpoint of interval} while i a then i:= m + 1 m else j:= m 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}
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
![Write and execute a program that can read 16 numbers from keyboard
and do the Binary search on them.
procedure binary search(x: integer, a ,a ., a : increasing integers)
2
i:= 1 {i is the left endpoint of interval}
j:= n {j is right endpoint of interval}
while i<j
m := [(i + j)/2]
if x > a theni:= m + 1
else j:= m
if x = a then location := i
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}](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fba7fd95f-e077-412e-ae99-be3b34946242%2F9b17f404-e7e5-4d3c-a58d-96a460811a60%2F32s946n_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Write and execute a program that can read 16 numbers from keyboard
and do the Binary search on them.
procedure binary search(x: integer, a ,a ., a : increasing integers)
2
i:= 1 {i is the left endpoint of interval}
j:= n {j is right endpoint of interval}
while i<j
m := [(i + j)/2]
if x > a theni:= m + 1
else j:= m
if x = a then location := i
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}
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 2 steps with 2 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY