C++ . Please make sure code has "Enter integer 1, etc" instead of allowing you to type integers without prompt. Lab10B: Binary Bubbles.Binary search is a very fast searching algorithm, however it requires a set of numbers to be sorted first.For this lab, create an array full of 11 integers which the user will generate. Like in the previous lab,assume that the values will be between -100 and +100. Then, using the sorting algorithm calledBubbleSort, put the array in the correct order (from lowest to highest number). After this, please printthe array to the screen. Finally, search the array for the target value using Binary Search.The BinarySearch code will implement the algorithm described in the lecture slides. During this, youshould print out a few key values which help Binary Search function. For example, this algorithmfocuses on a low, mid, and high which correspond to the indices in the array the algorithm iscurrently considering and searching.Printing these values during the search process will help with debugging and fixing any issues.• BubbleSort sorts the array to prepare for the next step• BinarySearch searches the now sorted array to determine if the target value is inthe array or notRemember, the file name should be Lab10B.The user input is indicated in bold.Sample output #1Please enter 11 numbers:Integer 1: 15Integer 2: 12Integer 3: 89Integer 4: -14Integer 5: 11Integer 6: -99Integer 7: 1Integer 8: 42Integer 9: 27Integer 10: 2Integer 1l: 67What is the target number 42The sorted set is: -99 -14 1 2 11 12 15 27 42 67 89Low is 0High is 11Mid is 5SearchingLow is 6High is 11Mid is 8SearchingThe target is in the set.Page 3 of 4Sample output #2Please enter 11 numbers:Integer 1: 15Integer 2: 12Integer 3: 89Integer 4: -14Integer 5: 11Integer 6: -99Integer 7: 1Integer 8: 42Integer 9: 27Integer 10: 2Integer 1l: 67What is the target number: -5The sorted set is: -99 -14 1 2 11 12 15 27 42 67 89Low is 0High is 11Mid is 5SearchingLow is 0High is 4Mid is 2SearchingLow is 0High is 1Mid is 0SearchingLow is 1High is 1Mid is 0SearchingThe target is not in the set. Lab10B: Binary Bubbles.Binary search is a very fast searching algorithm, however it requires a set of numbers to be sorted first.For this lab, create an array full of 11 integers which the user will generate. Like in the previous lab,assume that the values will be between -100 and +100. Then, using the sorting algorithm calledBubbleSort, put the array in the correct order (from lowest to highest number). After this, please printthe array to the screen. Finally, search the array for the target value using Binary Search.The BinarySearch code will implement the algorithm described in the lecture slides. During this, youshould print out a few key values which help Binary Search function. For example, this algorithmfocuses on a low, mid, and high which correspond to the indices in the array the algorithm iscurrently considering and searching.Printing these values during the search process will help with debugging and fixing any issues.• BubbleSort sorts the array to prepare for the next step• BinarySearch searches the now sorted array to determine if the target value is inthe array or notRemember, the file name should be Lab10B.The user input is indicated in bold.Sample output #1Please enter 11 numbers:Integer 1: 15Integer 2: 12Integer 3: 89Integer 4: -14Integer 5: 11Integer 6: -99Integer 7: 1Integer 8: 42Integer 9: 27Integer 10: 2Integer 1l: 67What is the target number 42The sorted set is: -99 -14 1 2 11 12 15 27 42 67 89Low is 0High is 11Mid is 5SearchingLow is 6High is 11Mid is 8SearchingThe target is in the set.Page 3 of 4Sample output #2Please enter 11 numbers:Integer 1: 15Integer 2: 12Integer 3: 89Integer 4: -14Integer 5: 11Integer 6: -99Integer 7: 1Integer 8: 42Integer 9: 27Integer 10: 2Integer 1l: 67What is the target number: -5The sorted set is: -99 -14 1 2 11 12 15 27 42 67 89Low is 0High is 11Mid is 5SearchingLow is 0High is 4Mid is 2SearchingLow is 0High is 1Mid is 0SearchingLow is 1High is 1Mid is 0SearchingThe target is not in the set.

#include <iostream> using namespace std; int main() { cout<<"Please enter 11…

Lab10B: Binary Bubbles. Binary search is a very fast searching algorithm, however it requires a set of numbers to be sorted first. For this lab, create an array full of 11 integers which the user will generate. Like in the previous lab, assume that the values will be between -100 and +100. Then, using the sorting algorithm called BubbleSort, put the array in the correct order (from lowest to highest number). After this, please print the array to the screen. Finally, search the array for the target value using Binary Search. The BinarySearch code will implement the algorithm described in the lecture slides. During this, you should print out a few key values which help Binary Search function. For example, this algorithm focuses on a low, mid, and high which correspond to the indices in the array the algorithm is currently considering and searching. Printing these values during the search process will help with debugging and fixing any issues. BubbleSort sorts the array to prepare for the next step • BinarySearch searches the now sorted array to determine if the target value is in the array or not Remember, the file name should be Lab10B. The user input is indicated in bold. Sample output #1 Please enter 11 numbers: Integer 1: 15 Integer 2: 12 Integer 3: 89 Integer 4: -14 Integer 5: 11 Integer 6: -99 Integer 7: 1 Integer 8: 42 Integer 9: 27 Integer 10: 2 Integer 11: 67 What is the target number 42 The sorted set is: -99 -14 1 2 11 12 15 27 42 67 89 Low is 0 High is 11 Mid is 5 Searching Low is 6 High is 11 Mid is 8 Searching The target is in the set.

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