Database System Concepts
Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
Bartleby Related Questions Icon

Related questions

Question
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
foarahing
expand button
Transcribed Image Text: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 foarahing
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.
expand button
Transcribed Image Text: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.
Expert Solution
Check Mark
Knowledge Booster
Background pattern image
Similar questions
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education