Exercise 2 (Binary Search) Assume a binary search is performed on the following array of integers: {1, 14, 15, 24, 55, 59, 73, 90, 94, 99} Trace through each iteration of the algorithm, writing the number that will be the middle element and the left and right bounds (indexes), when searching for the number 73.

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
Use java and use proper code indentation.
Exercise 2 (Binary Search)
Assume a binary search is performed on the following array of integers:
{1, 14, 15, 24, 55, 59, 73, 90, 94, 99}
Trace through each iteration of the algorithm, writing the number that will be the middle
element and the left and right bounds (indexes), when searching for the number 73.
Explanation of the Binary Search Concept
Binary Search is an algorithm for finding a target element in a sorted linear collection. It
assumes that there exists a comparison relation between all elements in the collection that
allows for a total ordering of the elements. For example, integers can be compared by the less
than (<) operator. For Strings, we can order them lexicographically and compare using the
compareTo method. The key assumption is that the linear collection is already sorted before
binary search is applied.
The binary search algorithm is naturally defined recursively as follows:
if collection is empty, return -1 to indicate target is not found
Check if middle element is the target
if yes, then return its index
elsé:
if middle element is < target,
then return outcome of binary search on the elements to the right of the middle
else return outcome of binary search on the elements to the left of the middle
Transcribed Image Text:Exercise 2 (Binary Search) Assume a binary search is performed on the following array of integers: {1, 14, 15, 24, 55, 59, 73, 90, 94, 99} Trace through each iteration of the algorithm, writing the number that will be the middle element and the left and right bounds (indexes), when searching for the number 73. Explanation of the Binary Search Concept Binary Search is an algorithm for finding a target element in a sorted linear collection. It assumes that there exists a comparison relation between all elements in the collection that allows for a total ordering of the elements. For example, integers can be compared by the less than (<) operator. For Strings, we can order them lexicographically and compare using the compareTo method. The key assumption is that the linear collection is already sorted before binary search is applied. The binary search algorithm is naturally defined recursively as follows: if collection is empty, return -1 to indicate target is not found Check if middle element is the target if yes, then return its index elsé: if middle element is < target, then return outcome of binary search on the elements to the right of the middle else return outcome of binary search on the elements to the left of the middle
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 3 images

Blurred answer
Knowledge Booster
Fundamentals of Multithreaded Algorithms
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