Figure 9-25 Flowchart for the binarysearch function binarySearch (Integer array[ ], Integer value, Integer arraySize), Declare Integer first = 0 Declare Integer last = arraySize – 1 Declare Integer position = -1 Declare Boolean found = False Declare Integer middle True (NOT found) AND (first <= last) Set middle = (first + last) /2 False Return position False array[middle] == True value Set found = True False array[middle] > value True Set position = middle %3D Set first = middle + 1 Set last = middle – 1

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...
icon
Related questions
Question
Reference the attached flowchart for the binarysearch function. Produce a trace table by hand tracing a Binary Search algorithm to find the value 7 in this array: [1, 3, 5, 7, 9, 11]. Remember, integer division produces a truncated integer result. Take a snapshot of the completed trace table.
Chapter 9
Sorting and Searching Arrays
Figure 9-25 Flowchart for the binarysearch function
binarySearch
(Integer array[ ],
Integer value,
Integer arraySize)
Declare Integer first = 0
Declare Integer last = arraySize – 1
Declare Integer position = -1
Declare Boolean found = False
Declare Integer middle
True
(NOT found) AND
(first <= last)
Set middle =
(first + last) / 2
False
Return position
False
array[middle] =
True
=
value
Set found = True
False
array[middle] >
True
value
Set position = middle
Set first = middle + 1
Set last = middle – 1
Transcribed Image Text:Chapter 9 Sorting and Searching Arrays Figure 9-25 Flowchart for the binarysearch function binarySearch (Integer array[ ], Integer value, Integer arraySize) Declare Integer first = 0 Declare Integer last = arraySize – 1 Declare Integer position = -1 Declare Boolean found = False Declare Integer middle True (NOT found) AND (first <= last) Set middle = (first + last) / 2 False Return position False array[middle] = True = value Set found = True False array[middle] > True value Set position = middle Set first = middle + 1 Set last = middle – 1
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 4 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
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 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)
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
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY