public static void search ( int key, int [] elemArray, Result r) { int bottom 0; %3D int top = elemArray.length - 1; %3D int mid ; r.found = false ; r.index = -1; %3D while ( bottom <= top ) { mid (top + bottom) / 2 ; if (elemArray [mid] key) == { r.index = mid ; r.found = true ; %3D return ; } // if part else { if (elemArray [mid] < key) bottom = mid + 1 ; else top = mid - 1; } } //while loop } // search } //BinSearch
public static void search ( int key, int [] elemArray, Result r) { int bottom 0; %3D int top = elemArray.length - 1; %3D int mid ; r.found = false ; r.index = -1; %3D while ( bottom <= top ) { mid (top + bottom) / 2 ; if (elemArray [mid] key) == { r.index = mid ; r.found = true ; %3D return ; } // if part else { if (elemArray [mid] < key) bottom = mid + 1 ; else top = mid - 1; } } //while loop } // search } //BinSearch
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
![public static void search ( int key, int [] elemArray, Result r)
{
int bottom = 0;
int top = elemArray.length - 1;
int mid ;
r.found = false ; r.index = -1;
while ( bottom <=
top )
{
mid = (top + bottom) / 2;
if (elemArray [mid] == key)
{
r.index = mid;
%D
r.found = true ;
%3D
return ;
} // if part
else
{
if (elemArray [mid] < key)
bottom = mid + 1;
else
top = mid - 1;
}
} //while loop
} // search
} //BinSearch](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F22d1beb8-cacb-4703-b45a-016abe058449%2F94200f45-a200-4f8d-b786-b101e51ac0ff%2Fvlu51p1_processed.png&w=3840&q=75)
Transcribed Image Text:public static void search ( int key, int [] elemArray, Result r)
{
int bottom = 0;
int top = elemArray.length - 1;
int mid ;
r.found = false ; r.index = -1;
while ( bottom <=
top )
{
mid = (top + bottom) / 2;
if (elemArray [mid] == key)
{
r.index = mid;
%D
r.found = true ;
%3D
return ;
} // if part
else
{
if (elemArray [mid] < key)
bottom = mid + 1;
else
top = mid - 1;
}
} //while loop
} // search
} //BinSearch
Transcribed Image Text:Considering the code segment below, answer the following questions:
1. Find the Cyclomatic Complexity using all three methods (7)
2. Does the Cyclomatic Complexity reflect the software design quality - briefly explain (3)
Code:
class BinSearch {
// This is an encapsulation of a binary search function that takes an array of
// ordered objects and a key and returns an object with 2 attributes namely
// index - the value of the array index
// found - a boolean indicating whether or not the key is in the array
// An object is returned because it is not possible in Java to pass basic types by
// reference to a function and so return two values
// the key is -1 if the element 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