Consider the list below. 1 12 35 36 45 57 62 76 123 124 How many comparisons using binary search are required to determine whether the following items are in the list or not?

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
icon
Related questions
Question

In C++ please.

 

NAVIGATE
Time Allotment: 5 minutes
Consider the list below.
1 12 35 36 45 57 62 76 123 124
How many comparisons using binary search are required to determine whether the following
items are in the list or not?
1. 45
2. 35
3. 12
4. 123
5. 62
Transcribed Image Text:NAVIGATE Time Allotment: 5 minutes Consider the list below. 1 12 35 36 45 57 62 76 123 124 How many comparisons using binary search are required to determine whether the following items are in the list or not? 1. 45 2. 35 3. 12 4. 123 5. 62
NAVIGATE
Time Allotment: 5 minutes
Let us check your knowledge.
const int size=10;
int arrl[size]={1, 12, 35, 36, 45, 57, 62, 76, 123, 124}, num;
bool found = false;
int i;
for (i=0; i<size && !found; i++)
if(arrl[i]>=num){
found = true;
break;
}
if (found)
if (arrl[i]==num)
cout << num << "
is found at position " << i << endl;
else
cout << num << " is not in the list. " << endl;
Consider the code snippet above.
How many times will the program search each cell in the list to determine whether the
following items are in the list or not?
1. 57
2. 35
3. 13
4. 125
5. 62
Transcribed Image Text:NAVIGATE Time Allotment: 5 minutes Let us check your knowledge. const int size=10; int arrl[size]={1, 12, 35, 36, 45, 57, 62, 76, 123, 124}, num; bool found = false; int i; for (i=0; i<size && !found; i++) if(arrl[i]>=num){ found = true; break; } if (found) if (arrl[i]==num) cout << num << " is found at position " << i << endl; else cout << num << " is not in the list. " << endl; Consider the code snippet above. How many times will the program search each cell in the list to determine whether the following items are in the list or not? 1. 57 2. 35 3. 13 4. 125 5. 62
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
ADT and Class
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
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education