// Among indexes first...last, return index of the target. // If target is not present then return -1. // precondition: the elements of array are in descending order. static int find(int [] array, int first, int last, int target) if (first > last) { // one very short line } if (first == last) { // one line, using the conditional operator } int mid = (first+last+1)/2; %3D if (target <= array[mid]) { // one line, involving a recursive call } // one line, involving a recursive call

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

In java 

i have some code for a method that finds the index of an integer that is passed in thet int is (target) the method also has the array called (array) and the first and last element of the array. also for this method to work the array has to be in descending order

"static int find(int [] array, int first, int last, int target)"

thats the method with all the variables that are passed to it 

my guess is that the first if statement just will have a short line that is

"return -1;" because since the array has to be in descending order the first element cant be greater then the last element in the array but im confused on the rest because i cant find a way to make them one line codes with the conditions that i have to meet in the comments any help would be aprreaciated

// Among indexes first...last, return index of the target.
// If target is not present then return -1.
// precondition: the elements of array are in descending order.
static int find(int [] array, int first, int last, int target)
if (first > last) {
// one very short line
}
if (first == last) {
// one line, using the conditional operator
}
int mid = (first+last+1)/2;
if (target <= array[mid]) {
// one line, involving a recursive call
}
// one line, involving a recursive call
Transcribed Image Text:// Among indexes first...last, return index of the target. // If target is not present then return -1. // precondition: the elements of array are in descending order. static int find(int [] array, int first, int last, int target) if (first > last) { // one very short line } if (first == last) { // one line, using the conditional operator } int mid = (first+last+1)/2; if (target <= array[mid]) { // one line, involving a recursive call } // one line, involving a recursive call
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Array
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
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