int binarysearch (const int list(], int listlength, int searchItem) int first - 0; int last - listlength - 1, int mid: bool found - talse while (first <- last 66 !found) mid - (first + last) / 2: if (list(mid] - searchitem) found - true else it (list(mid) > searchItem) last - mid - i; else first - mid + 1; if (found) return mid, else retun -1: //end binarysearch Consider using the Binary Search Algorithm, shown above, to find if 75 belongs to the following list: 25 34 39 45 75 95 19 48 66 89 At the last iteration inside the algorithm, What will be the value of the variables: first, mid, last? First= 9, Mid=10, and Last=12 First= 9, Mid=9, and Last=11 O I. First= 9, Mid=10, and Last=11 Ov. All the answers are wrong
int binarysearch (const int list(], int listlength, int searchItem) int first - 0; int last - listlength - 1, int mid: bool found - talse while (first <- last 66 !found) mid - (first + last) / 2: if (list(mid] - searchitem) found - true else it (list(mid) > searchItem) last - mid - i; else first - mid + 1; if (found) return mid, else retun -1: //end binarysearch Consider using the Binary Search Algorithm, shown above, to find if 75 belongs to the following list: 25 34 39 45 75 95 19 48 66 89 At the last iteration inside the algorithm, What will be the value of the variables: first, mid, last? First= 9, Mid=10, and Last=12 First= 9, Mid=9, and Last=11 O I. First= 9, Mid=10, and Last=11 Ov. All the answers are wrong
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
at the last itration insade the algrothim
what will be the value above of the variables:first,mid,last
![int binarysearch (const int list(), int listLength, int searchItem)
int first - 0:
int last - listlength - 1;
int mid;
bool found - false;
while (first <- last 66 !found)
mid - (first + last) / 2:
if (list(mid] - searchitem)
found true;
else if (1iat(mid) > searchItem)
last - mid - i;
else
first - mid + 1;
if (found)
return mids
else
return -1;
}//end binarysearch
Consider using the Binary Search Algorithm, shown above, to find if 75 belongs
to the following list:
8
19
25
34
39
45
48
66
75
89
95
At the last iteration inside the algorithm,
What will be the value of the variables: first, mid, last?
First= 9, Mid=10, and Last=12
First= 9, Mid=9, and Last=11
O I.
First= 9, Mid=10, and Last=11
O V.
All the answers are wrong](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F9990e5a1-74f5-411b-841c-69c7b57f1c86%2Fe20eed04-f87e-4074-a0b4-c3bfe8ad5742%2F85ptj2_processed.png&w=3840&q=75)
Transcribed Image Text:int binarysearch (const int list(), int listLength, int searchItem)
int first - 0:
int last - listlength - 1;
int mid;
bool found - false;
while (first <- last 66 !found)
mid - (first + last) / 2:
if (list(mid] - searchitem)
found true;
else if (1iat(mid) > searchItem)
last - mid - i;
else
first - mid + 1;
if (found)
return mids
else
return -1;
}//end binarysearch
Consider using the Binary Search Algorithm, shown above, to find if 75 belongs
to the following list:
8
19
25
34
39
45
48
66
75
89
95
At the last iteration inside the algorithm,
What will be the value of the variables: first, mid, last?
First= 9, Mid=10, and Last=12
First= 9, Mid=9, and Last=11
O I.
First= 9, Mid=10, and Last=11
O V.
All the answers are wrong
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 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