Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
make if you tried to guess the secret number (secretNum) by means of binary search. Input Format Input is three space separated values. First 2 values give the range - low and high or high and low, third is the secret number we are trying to guess. Think about how your guess is made: What is the largest value an integer can have? What happens if both are low and high values are really close to the largest value possible? This could be a reason if you are getting an error on the second test case. Constraints all three values are valid Java integers. The secret number is guaranteed to be greater than or equal to the low value and less than or equal to the high value. Output Format On a single line, display all the guesses we would make if we didn't know the secret number but instead used our binary search technique and relied on information after each guess whether we guessed too high or too low. Sample Input 0 1 10 7 Sample Output 0 5867 Explanation 0 From the input: low = 1, high = 10, The number we are trying to guess is 7 Our first guess is 5 --> too low. We are now looking for a number between 6 and 10 Our second guess is 8 --> too high. We are now looking for a number between 6 and 7 Our third guess is 6 --> too low. Remember, we are looking at integer values, no rounding! We are now looking for a number between 7 and 7 Our fourth guess is 7 --> found it! Sample Input 1 110 100 104 Sample Output 1 105 102 103 104 Explanation 1 first guess-> 105. Too high, so that eliminates 105 through 110 second guess-> 102. Too low, so that eliminates 100, 101, and 102 third guess-> 103. Too low, that leaves: fourth guess-> 104. Found it! Just how do we calculate our guess? What happens if we are searching through really large. values?

make if you tried to guess the secret number (secretNum) by means of binary search. Input Format Input is three space separated values. First 2 values give the range - low and high or high and low, third is the secret number we are trying to guess. Think about how your guess is made: What is the largest value an integer can have? What happens if both are low and high values are really close to the largest value possible? This could be a reason if you are getting an error on the second test case. Constraints all three values are valid Java integers. The secret number is guaranteed to be greater than or equal to the low value and less than or equal to the high value. Output Format On a single line, display all the guesses we would make if we didn't know the secret number but instead used our binary search technique and relied on information after each guess whether we guessed too high or too low. Sample Input 0 1 10 7 Sample Output 0 5867 Explanation 0 From the input: low = 1, high = 10, The number we are trying to guess is 7 Our first guess is 5 --> too low. We are now looking for a number between 6 and 10 Our second guess is 8 --> too high. We are now looking for a number between 6 and 7 Our third guess is 6 --> too low. Remember, we are looking at integer values, no rounding! We are now looking for a number between 7 and 7 Our fourth guess is 7 --> found it! Sample Input 1 110 100 104 Sample Output 1 105 102 103 104 Explanation 1 first guess-> 105. Too high, so that eliminates 105 through 110 second guess-> 102. Too low, so that eliminates 100, 101, and 102 third guess-> 103. Too low, that leaves: fourth guess-> 104. Found it! Just how do we calculate our guess? What happens if we are searching through really large. values?

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

A program in java 

make if you tried to guess the secret number (secretNum) by means of binary search. Input Format Input is three space separated values. First 2 values give the range - low and high or high and low, third is the secret number we are trying to guess. Think about how your guess is made: What is the largest value an integer can have? What happens if both are low and high values are really close to the largest value possible? This could be a reason if you are getting an error on the second test case. Constraints all three values are valid Java integers. The secret number is guaranteed to be greater than or equal to the low value and less than or equal to the high value. Output Format On a single line, display all the guesses we would make if we didn't know the secret number but instead used our binary search technique and relied on information after each guess whether we guessed too high or too low. Sample Input 0 1 10 7 Sample Output 0 5867 Explanation 0 From the input: low = 1, high = 10, The number we are trying to guess is 7 Our first guess is 5 --> too low. We are now looking for a number between 6 and 10 Our second guess is 8 --> too high. We are now looking for a number between 6 and 7 Our third guess is 6 --> too low. Remember, we are looking at integer values, no rounding! We are now looking for a number between 7 and 7 Our fourth guess is 7 --> found it! Sample Input 1 110 100 104 Sample Output 1 105 102 103 104 Explanation 1 first guess --> 105. Too high, so that eliminates 105 through 110 second guess --> 102. Too low, so that eliminates 100, 101, and 102 third guess --> 103. Too low, that leaves: fourth guess --> 104. Found it! Just how do we calculate our guess? What happens if we are searching through really large values? Java 8
Transcribed Image Text:make if you tried to guess the secret number (secretNum) by means of binary search. Input Format Input is three space separated values. First 2 values give the range - low and high or high and low, third is the secret number we are trying to guess. Think about how your guess is made: What is the largest value an integer can have? What happens if both are low and high values are really close to the largest value possible? This could be a reason if you are getting an error on the second test case. Constraints all three values are valid Java integers. The secret number is guaranteed to be greater than or equal to the low value and less than or equal to the high value. Output Format On a single line, display all the guesses we would make if we didn't know the secret number but instead used our binary search technique and relied on information after each guess whether we guessed too high or too low. Sample Input 0 1 10 7 Sample Output 0 5867 Explanation 0 From the input: low = 1, high = 10, The number we are trying to guess is 7 Our first guess is 5 --> too low. We are now looking for a number between 6 and 10 Our second guess is 8 --> too high. We are now looking for a number between 6 and 7 Our third guess is 6 --> too low. Remember, we are looking at integer values, no rounding! We are now looking for a number between 7 and 7 Our fourth guess is 7 --> found it! Sample Input 1 110 100 104 Sample Output 1 105 102 103 104 Explanation 1 first guess --> 105. Too high, so that eliminates 105 through 110 second guess --> 102. Too low, so that eliminates 100, 101, and 102 third guess --> 103. Too low, that leaves: fourth guess --> 104. Found it! Just how do we calculate our guess? What happens if we are searching through really large values? Java 8
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Problems on Number Theoretic Algorithm
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
SEE MORE TEXTBOOKS