Coding Exercise Run the code below. Try searching for the value 3 and then the value 2 which is not in the array. What would happen if we removed the second base case checking if end < start? Try it and see.

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

No hand written and fast answer with explanation

 

Here is the Java code for a recursive binary search:
Coding Exercise
Run the code below. Try searching for the value 3 and then the value 2 which is not in the array. What would happen if we removed
the second base case checking if end < start? Try it and see.
Transcribed Image Text:Here is the Java code for a recursive binary search: Coding Exercise Run the code below. Try searching for the value 3 and then the value 2 which is not in the array. What would happen if we removed the second base case checking if end < start? Try it and see.
RecursiveBinarySearch.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
public class RecursiveBinarySearch
{
public static int recursiveBinarySearch(int[] array, int start, int end, int target)
{
29
30
31
32 }
33
int middle = (start + end)/2;
// base case: check middle element
}
if (target == array[middle]) {
return middle;
}
// base case: check if we've run out of elements
if(end < start) {
return -1; // not found
}
// recursive call: search start to middle
if (target < array[middle]){
return recursiveBinarySearch(array, start, middle 1, target);
}
// recursive call: search middle to end
if (target > array[middle]){
return recursiveBinarySearch(array, middle + 1, end, target);
}
public static void main(String[] args)
(
}
return -1;
int[] array { 3, 7, 12, 19, 22, 25, 29, 30 };
.
int target 25;
int foundIndex recursiveBinarySearch(array, e, array.length-1, target);
System.out.println(target + was found at index"+foundIndex);
Transcribed Image Text:RecursiveBinarySearch.java 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 public class RecursiveBinarySearch { public static int recursiveBinarySearch(int[] array, int start, int end, int target) { 29 30 31 32 } 33 int middle = (start + end)/2; // base case: check middle element } if (target == array[middle]) { return middle; } // base case: check if we've run out of elements if(end < start) { return -1; // not found } // recursive call: search start to middle if (target < array[middle]){ return recursiveBinarySearch(array, start, middle 1, target); } // recursive call: search middle to end if (target > array[middle]){ return recursiveBinarySearch(array, middle + 1, end, target); } public static void main(String[] args) ( } return -1; int[] array { 3, 7, 12, 19, 22, 25, 29, 30 }; . int target 25; int foundIndex recursiveBinarySearch(array, e, array.length-1, target); System.out.println(target + was found at index"+foundIndex);
Expert Solution
steps

Step by step

Solved in 5 steps with 6 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.
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