Write methods that implement linear and binary search. Have both methods display the value searched for, and the number of iterations needed to find the value. You will need to add System.out.println() statements just before both return statements for each algorithm. You will also need to add some kind of counter to track iterations. To test this, create an array: (0, 1, 2, 3, 4, 5, 6, 7, 8, ..) of at least 100 values. Search for the following values in the array, first using linear search, then using binary search. Values: 5 10 17 20 25 50 83 n, where n is the length of the array. (If the array has 100 values, search for the number 100.) -1
Write methods that implement linear and binary search. Have both methods display the value searched for, and the number of iterations needed to find the value. You will need to add System.out.println() statements just before both return statements for each algorithm. You will also need to add some kind of counter to track iterations. To test this, create an array: (0, 1, 2, 3, 4, 5, 6, 7, 8, ..) of at least 100 values. Search for the following values in the array, first using linear search, then using binary search. Values: 5 10 17 20 25 50 83 n, where n is the length of the array. (If the array has 100 values, search for the number 100.) -1
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
For JAVA.
Transcribed Image Text:Write methods that implement linear and binary search.
Have both methods display the value searched for, and the number of iterations needed
to find the value. You will need to add System.out.println() statements just before
both return statements for each algorithm. You will also need to add some kind of
counter to track iterations.
To test this, create an array: (0, 1, 2, 3, 4, 5, 6, 7, 8, ..) of at least 100
values.
Search for the following values in the array, first using linear search, then using binary
search.
Values:
5
10
17
20
25
50
83
n, where n is the length of the array. (If the array has 100 values, search for the number 100.)
-1
Transcribed Image Text:Your program output should look like this:
Testing search with an array of length 100
Testing linear search:
Linear search needed 5 iterations to find 5.
Linear search needed 10 iterations to find 10.
Linear search needed 17 iterations to find 17.
Linear search needed 20 iterations to find 20.
Linear search needed 25 iterations to find 25.
Linear search needed 50 iterations to find 50.
Linear search needed 83 iterations to find 83.
Linear search needed 100 iterations and FAILED to find 100.
Linear search needed 100 iterations and FAILED to find -1.
Testing binary search:
binarySearch needed 4 iterations to find 5.
binarySearch needed 7 iterations to find 10.
binarySearch needed 4 iterations to find 17.
binarySearch needed 5 iterations to find 20.
binarySearch needed 6 iterations to find 25.
binarySearch needed 6 iterations to find 50.
binarySearch needed 5 iterations to find 83.
binarySearch needed 7 iterations and FAILED to find 100.
binarySearch needed 6 iterations and FAILED to find -1.
You will need to resize the console window in Eclipse to view all the program output.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 5 images
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