1. The sorted values array contains 16 integers 5, 7, 10, 13, 13, 20, 21, 25, 30, 32, 40, 45, 50, 52, 57, 60. Indicate the sequence of recursive calls that are made to binaraySearch, given an initial invocation of binarySearch(32, 0, 15).show only the recursive calls. For example, initial invocation is binarySearch(45,0,15)where the target is 45, first is 0 and last is 15.

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

1. The sorted values array contains 16 integers 5, 7, 10, 13, 13, 20, 21, 25, 30,
32, 40, 45, 50, 52, 57, 60. Indicate the sequence of recursive calls that are made to
binaraySearch, given an initial invocation of binarySearch(32, 0, 15).show only the recursive calls. For example, initial invocation is binarySearch(45,0,15)where the target is 45, first is 0 and last is 15.

boolean binarySearch (int target, int first, int last)
// Precondition: first and last are legal indices of values
//
// If target is contained in values [first,last] return true
// otherwise return false.
{
int midpoint = (first + last) / 2;
if (first > last)
return false;
else
if (target == values [midpoint])
return true;
else
if (target > values[midpoint])
return binarySearch (target, midpoint + 1, last);
else
return binarySearch (target, first, midpoint - 1);
}
Transcribed Image Text:boolean binarySearch (int target, int first, int last) // Precondition: first and last are legal indices of values // // If target is contained in values [first,last] return true // otherwise return false. { int midpoint = (first + last) / 2; if (first > last) return false; else if (target == values [midpoint]) return true; else if (target > values[midpoint]) return binarySearch (target, midpoint + 1, last); else return binarySearch (target, first, midpoint - 1); }
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 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