In Java!!!. Design and implement a recursive version of a binary search. For the recursive version, instead of using a loop to repeatedly loop for the target value, allow each call to a recursive method check one value. If the value is not the target, refine the search space and call the method again. The indexes that define the range of viable candidates can be passed to the method. The base case is either finding the target value or running out of data to search. Design the program to work for on an array of sorted String objects.

In Java!!!. Design and implement a recursive version of a binary search. For the recursive version, instead of using a loop to repeatedly loop for the target value, allow each call to a recursive method check one value. If the value is not the target, refine the search space and call the method again. The indexes that define the range of viable candidates can be passed to the method. The base case is either finding the target value or running out of data to search. Design the program to work for on an array of sorted String objects.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

Write a RECURSIVE method called “sequence” that takes a single int parameter (n) and returns the int value of the nth element of the sequence S = 2, 4, 6, 12, 22, 40, 74, 136, 250, 460, … Where S is defined by the recursive formula: For n >= 0S(0) = 2; // Base case 1S(1) = 4; // Base case 2S(2) = 6; // Base case 3S(N) = 2 * ( S(N-1)/2 + S(N-2)/2 + S(N-3)/2)
please answer if the question is true or false In the Recursive Binary Search shown below, there are two base cases: Line 10: the search is exhausted without a finding a value that matches the key Line 16: the search finds a value that matches the key 1 public class RecursiveBinarySearch { 2 public static int binarySearch(int[] list, int key) { 3 int low = 0; 4 int high = list.length - 1; 5 return binarySearch(list, key, low, high); 6 } 7 8 private static int binarySearch(int[] list, int key, 9 int low, int high) { 10 if (low > high) // The list has been exhausted without a match 11 return -low - 1; 12 13 int mid = (low + high) / 2; 14 if (key < list[mid]) 15 return binarySearch(list, key, low, mid - 1); 16 else if (key == list[mid]) 17 return mid; 18 else 19 return binarySearch(list, key, mid + 1, high); 20 } 21 22 public static void main(String[]…
Trace the execution of the call mystery(4) for the following recursive method using the technique shown in slide#15. What does this method do? public static mystery(int n) { if (n == 0) return 0; else return n*n + mystery(n-1); } Answer the above exercise using activation frames.
Please implement in Java implement a keyed bag in which the items to be stored are strings (perhaps people’s names) and the keys are numbers (perhaps Social Security or other identification numbers). So, the in- sertion method has this specification: public void insert(String entry, int key);// Precondition: size( ) < CAPACITY, and the // bag does not yet contain any item// with the given key.// Postcondition: A new copy of entry has// been added to the bag, with the given key. When the programmer wants to remove or retrieve an item from a keyed bag, the key of the item must be specified rather than the item itself. The keyed bag should also have a boolean method that can be used to determine whether the bag has an item with a specified key. In a keyed bag, the pro- grammer using the class specifies a particular key when an item is inserted. Here’s an implementation idea: A keyed bag can have two private arrays, one that holds the string data and one that holds the corresponding…
Attached is a programming question and its solution written in Java. My questions regarding the program are as follows: 1. Where is the base case? In order words, where in the program stops the recursion (after it does its job)? Please identify and explain. 2. When the recursive method is called inside itself, does the for-loop run from i to str.length()? Or, when will i++ be evaluated? It seems to me that i can easily reach str.length() because String leftOver always decreases in length, and this terminates the recursion. Please explain.
You have a card on which the letter J is written on one side and K on the other. You want to seeall of the possible ways the card will land if you drop it n times. Write a recursive method thatprints each session of dropping the cards with J's and K's. For example if you drop it 4 times in agiven session, all possible ways to drop it are as follows (in exactly the specified order): J J J JJ J J KJ J K JJ J K KJ K J JJ K J KJ K K JJ K K KK J J JK J J KK J K JK J K KK K J JK K J KK K K JK K K K
Write a recursive method public static int pos(int[] a, int l,int r) that positions a[l] at its rank if the array a were sorted between l and r,and that returns this rank. That is, we assume that a is an unsorted array of int,l and r are int such that 0 <= l <= r < a.length, after this call : k = pos(a, l, r); acontains the same elements before and after this call, but it is such that a[k] >=a[i] for all i in [l, k-1] and a[k] < a[j] for all j in [k+1, r].For instance, consider this fragment: int[] a = {8,7,4,1,9,6,2,5,3,0};System.out.println(Arrays.toString(a));// [8, 7, 4, 1, 9, 6, 2, 5, 3, 0]pos(a, 2, 7); // a[2..7] = {4, 1, 9, 6, 2, 5}System.out.println(Arrays.toString(a));/* [8, 7, 1, 2, 4, 6, 5, 9, 3, 0] is possible because4 >= 2, 4 >= 1, 4 < 6, 4 < 5, 4 < 9.But It could also be [8, 7, 2, 1, 4, 6, 5, 9, 3, 0], or[8, 7, 2, 1, 4, 9, 5, 6, 3, 0] */
can you please fix the AssertionError in this and also the code: (please don't use try and except or break/continue or recursion) def hike_unique(m: list[list[int]], start_point: tuple[int, int],end_point: tuple[int, int]) -> int: if start_point == end_point:return 0else:front_row = start_point[0]front_column = start_point[1]end_row = end_point[0]end_column = end_point[1]front_eva = m[front_row][front_column]end_eva = m[end_row][end_column]eva_diff = abs(front_eva - end_eva)if front_row == end_row:total_cost = eva_diff * (abs(front_column - end_column)) + 1elif front_column == end_column:total_cost = eva_diff * (abs(front_row - end_row)) + 1else:total_cost = eva_diff * (abs(front_row - end_row) + abs(front_column - end_column)) - 1return total_cost print(hike_unique(sample_map, (1, 1), (0, 0)) It should print 3 if the sample_map is >>> sample_map = [[1, 3], ... [0, 4]] if you do…
implement a parametrized version of mergesort that will allow us to choose how many parts the input array will be divided into.This method will take an integer array and integer K as inputs and produce one integer array as output. It will sort the input array by dividing it into K parts, recursively sorting those parts, and using the mergeAll method to merge the K sorted arrays into one sorted array. Implement the mergesortK method public static int[] mergesortK(int[] arr, int k) { return new int[] {-1}; } *must be done in this format and in java please
In JavaScript use recursion to find the sum of all pages in the following: function getPageTotal(list) {// your code here// returns an integer}Example test case:Input: {"book":"A","pages":50,"next":{"book":"B","pages":25,"next": null}}Output: 75Reasoning: 50 + 25 pages
Interpreter.java is missing these methods in the code so make sure to add them: -print, printf: Exist, marked as variadic, call Java functions -getline and next: Exist and call SplitAndAssign -gsub, match, sub, index, length, split, substr, tolower, toupper: Exist, call Java functions, correct return Below is interpreter.java import java.util.ArrayList; import java.util.HashMap; import java.util.List; public class Interpreter { private HashMap<String, InterpreterDataType> globalVariables; private HashMap<String, FunctionDefinitionNode> functions; private class LineManager { private List<String> lines; private int currentLineIndex; public LineManager(List<String> inputLines) { this.lines = inputLines; this.currentLineIndex = 0; } public boolean splitAndAssign() { if (currentLineIndex < lines.size()) { String currentLine = lines.get(currentLineIndex);…
In writing a general-purpose sort method in Java, the sort method needs to compareobjects. There are two ways to give the sort method the code to compare objects,implementing the interfaces Comparable and Comparator respectively. Extend Article class toimplement Comparable interface so that the default sorting of the Articles is by its volume