Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Write methods that implement linear, binary, and recursive 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 Sample output should look like this (be sure to include binary and binary recursive as well): 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.

Write methods that implement linear, binary, and recursive 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 Sample output should look like this (be sure to include binary and binary recursive as well): 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.

Database System Concepts
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
See similar textbooks
icon
Related questions
Question

For JAVA.

Write methods that implement linear, binary, and recursive 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 Sample output should look like this (be sure to include binary and binary recursive as well): 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.
Transcribed Image Text:Write methods that implement linear, binary, and recursive 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 Sample output should look like this (be sure to include binary and binary recursive as well): 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.
Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Time complexity
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.
Similar questions
  • SEE MORE QUESTIONS
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
SEE MORE TEXTBOOKS