last- listLength mid: 1 found - false le (firat <- last s mid - (first + last it (list(mid) - found else it (1ist(mid] last - mid - ia else se - true tirst - mid (found) return mida
last- listLength mid: 1 found - false le (firat <- last s mid - (first + last it (list(mid) - found else it (1ist(mid] last - mid - ia else se - true tirst - mid (found) return mida
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
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 (1ist(mid) > searchItem)
last - mid - 1;
else
first - mid + 1
if (found)
return mid;
else
return -1,
//end binarysearch
Consider using the Binary Search Algorithm, shown above, to find if 75 belongs
to the following list:
4 8
25
| 34
| 45
48
| 66
| 75
| 89
95
|19
39
At iteration-1 inside the algorithm,
What will be the value of the variables: first, mid, last?
O1.
First= 1, Mid=6, and Last=12
OI.
First= 1, Mid=6, and Last=11
O II.
First= 0, Mid=5, and Last=11
O V.
First= 0, Mid=5, and Last=12
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
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