Below is a recursive version of binary search, which was not presented inclass.The method contains an error because:1) public static int binarySearch(int[] a, int hi, int low, int mid, int x){2)3)4)5)6)if (low > hi)return -1;else if (a[mid] == x)return mid;else if (x < a[mid])return binarysearch(a,mid-1, low, (low+mid-1)/2,x);3%3D8)9)10) }elsereturn binarysearch(a, hi,mid+1, (mid+1+hi)/2,x);O it never calculates the midpointO it incorrectly mixes up parameters in the recursive call on line 7O it incorrectly mixes up parameters in the recursive call on line 9O it doesn't have a basis caseO none of the above

The correct answer is given in the next step along with an explanation Also, the correct code is…

Below is a recursive version of binary search, which was not presented in class. The method contains an error because: 1) public static int binarySearch(int[] a, int hi, int low, int mid, int x) { 2) 3) 4) 5) 6) 7) 8) 9) 10) } if (low > hi) return -1; else if (a[mid] return mid; else if (x < a[mid]) return binarysearch(a,mid-1, low,(low+mid-1)/2,x); х) =3= else return binarySearch(a,hi,mid+1, (mid+1+hi)/2,x); O it never calculates the midpoint O it incorrectly mixes up parameters in the recursive call on line 7 O it incorrectly mixes up parameters in the recursive call on line 9 O it doesn't have a basis case none of the above

Below is a recursive version of binary search, which was not presented in class. The method contains an error because: 1) public static int binarySearch(int[] a, int hi, int low, int mid, int x) { 2) 3) 4) 5) 6) 7) 8) 9) 10) } if (low > hi) return -1; else if (a[mid] return mid; else if (x < a[mid]) return binarysearch(a,mid-1, low,(low+mid-1)/2,x); х) =3= else return binarySearch(a,hi,mid+1, (mid+1+hi)/2,x); O it never calculates the midpoint O it incorrectly mixes up parameters in the recursive call on line 7 O it incorrectly mixes up parameters in the recursive call on line 9 O it doesn't have a basis case none of the above

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

Similar questions

Please help me with the below using java. Please also comment the code (explai. What each li e is doing). Please make sure both codes are completed using recursion
Write a recursive method in java that sums all values between s and n inclusive /* assume s is less than or equal to n to start */ public static int sum(int s, int n) { }
int arr[] = {-2, -4, 8, 4, 3, 3, -9};In Java with this given this array, how would this version of Divide and Conqueror be implemented in this case, specifically?
Write a statement that calls the recursive method backwardsAlphabet() with parameter starting Letter. 789GHA 10 11 12 13 } TENN 14 15 16 17 18 19 20 21 22 } 23 } } else { } System.out.print(currLetter + "); backwardsAlphabet((char) (currLetter - 1)); public static void main (String[] args) { Scanner scnr = new Scanner(System.in); char startingLetter; startingLetter = scnr.next().charAt(0); /* Your solution goes here */ ▶
Java - How many recursive calls will be made if the following method is called with 6? void greeting(int n) { system.out.println(“Hello!”); greeting(n-1); }