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

1. task: Introduction and basics. And again, Peter Puzzle has found a piece of paper with the following code: int FooBar (A, i) { n= len (A); if (i == n-1) return A; for (j= (i + 1); j
JAVA
Complete the combinations function to generate all combinations of the characters in the string s with length k recursively
For JAVA.
public class Main { public static void main(String[] args) { System.out.println("Your factorial is: " + factorial(9)); }} public static int factorial(int number) { if (number == 0) { return 1; } return number * factorial(number -1); } i need help fixing this code involving recursion
19. Write a recursive (no "while" or "for" or any looping statement) method "frequency", which takes as parameters an IntNode myList and an integer element and returns the number of times the integer element appears in myList. public class IntNode. { private int m_data; private IntNode m link; public IntNode (int data, IntNode link) { m data data; m link link; } public int getInfo() {return m_data; } public IntNode getLink () {return m_link; } } public int frequency (IntNode myList, int element) {
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
PROGRAM IN C++ Our BoardArray will store 5 entries maximum. Improve the following existing methods: bool add(entry* e) Improve the add method where you will return true if the entry has been successfully added (i.e. the entry is placed in the top 10), otherwise return false (i.e. if the entry did not make it to the top 10). bool remove(const char* person) Improve the remove method where you return true if an entry is successfully deleted (i.e. we have found an entry that matches the person), otherwise return false. Add the following additional methods: bool ban_country(const char* nation) Removes all the entries bearing the country equal to the given nation. Return true if at least one entry has been removed, otherwise return false. int country_wins(const char* nation) Returns the number of entries in the scoreboard who represents the given nation. int exemplary(int score) Returns how many entries in the scoreboard are greater than or equal to the given score. double…
java
Consider the following recursive method: public int recursiveMethod (int n) if (n <= 0) return 0; else int smaller = n - 1; return recursiveMethod (smaller) + n (n - 1); What is the integer return of a call recursiveMethod (5)? 36 39 40 44 Next Page Previous Page
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?
After completing the methods, use the main method to test them.