23- following code is an example of arecursive algorithm.int myRecursion (int array[], int first, int last, int val){int num;if (first > last)return -1;num = (first + last) /2;if (array[num]return num;== val)if (array[num] < val)return myRecursion (array, num + 1, last, val);elsereturn myRecursion (array, first, num- 1, val);}a. Towers of Hanoib. QuickSortc. binary searchd. doubly linked listNone of theseе.

Function myRecursion() has four function parameters, an array[], first, last and a val. Inside the…

23- following code is an example of a recursive algorithm. int myRecursion (int array[], int first, int last, int val) { int num; if (first > last) return -1; num = (first + last)/2; if (array[num] == val) return num; if (array [num] < val) return myRecursion (array, num + 1, last, val); else return myRecursion(array, first, num - 1, val); } a. Towers of Hanoi b. QuickSort c. binary search d. doubly linked list None of these

23- following code is an example of a recursive algorithm. int myRecursion (int array[], int first, int last, int val) { int num; if (first > last) return -1; num = (first + last)/2; if (array[num] == val) return num; if (array [num] < val) return myRecursion (array, num + 1, last, val); else return myRecursion(array, first, num - 1, val); } a. Towers of Hanoi b. QuickSort c. binary search d. doubly linked list None of these

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter10: Classes And Data Abstraction

Section: Chapter Questions

Problem 23PE

See similar textbooks

Similar questions

1-Write a JAVA program to delete duplicate elements from array. How to removeduplicate elements from array in JAVA programming. After performing delete operationthe array should only contain unique integer value. Logic to delete duplicate elementsfrom array.ExampleInputInput array elements: 10, 20, 10, 1, 100, 10, 2, 1, 5, 10OutputAfter removing all duplicate elementsElements of array are: 10, 20, 1, 100, 2, 5
Java Quick Sort but make it read the data 10, 7, 8, 9, 1, 5 from a file not an array // Java implementation of QuickSort import java.io.*; class GFG { // A utility function to swap two elements static void swap(int[] arr, int i, int j) { int temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; } /* This function takes last element as pivot, places the pivot element at its correct position in sorted array, and places all smaller (smaller than pivot) to left of pivot and all greater elements to right of pivot */ static int partition(int[] arr, int low, int high) { // pivot int pivot = arr[high]; // Index of smaller element and // indicates the right position // of pivot found so far int i = (low - 1); for (int j = low; j <= high - 1; j++) { // If current element is smaller // than the pivot if…
convert this python code into java? Python code is as shown below: # recursive function def row_puzzle_rec(row, pos, visited): # if the element at the current position is 0 we have reached our goal if row[pos] == 0: possible = True else: # make a copy of the visited array visited = visited[:] # if the element at the current position has been already visited then it's a loop. # as then its not possible to reach the last element, set possible to False if visited[pos]: possible = False else: # set visitied for the element as True visited[pos] = True possible = False # if its possible to move left then recurse in the left direction if pos - row[pos] > 0 and row_puzzle_rec(row, pos - row[pos], visited): # return immediately if the goal is reached return True # if its possible to move right then recurse in the right…
can you please convert this python code into java? Python code is as shown below: # recursive function def row_puzzle_rec(row, pos, visited): # if the element at the current position is 0 we have reached our goal if row[pos] == 0: possible = True else: # make a copy of the visited array visited = visited[:] # if the element at the current position has been already visited then it's a loop. # as then its not possible to reach the last element, set possible to False if visited[pos]: possible = False else: # set visitied for the element as True visited[pos] = True possible = False # if its possible to move left then recurse in the left direction if pos - row[pos] > 0 and row_puzzle_rec(row, pos - row[pos], visited): # return immediately if the goal is reached return True # if its possible to move right then recurse in…
Question1. Use recursion [ a. Write a Java method to find the largest element in the array using recursion. public static int largestelement(int[] arr,int n){ } b. Write a Java method to find a target in an array using binary search. (Note the array is sorted descendingly) public static int binarysearch(int[] arr, int target,int l,int r){ } c. Call the methods largestelement() and binarysearch() using the following array a=[13,10,9,8,4,3] and target=10 ANSWER: Output screen capture:
The following function recursively locates the index of the target value in the array passed in as numbers, returning -1 if the target is not found. Some parts have been removed. fill in the missing code. def find_val(target, numbers, start_index=0): if : _______#base cases return ______ elif :_____ return _____ else:______ #recursive case return ______
java: // Class to do MergeSort and QuickSort on int arrays and test them public class MergeQuickSorts { // Create a main to test MergeSort and QuickSort for // three cases - Sorted Aray, Reverse Sorted Array, Random Array // Each array should be size 50 // For the sorted array use the entries 1, 2, 3......50 // For the reverse sorted array use the entries 50, 49, 48.....1 // For the random array use ints between 1 and 50 inclusive, duplicates allowed // For each of the 6 sorts print the array before and after the sort // and show clearly which sort is being done public static void main(String[] args) { }
Computer Science Q2) Write a Java program to retrieve all the index of a given element of the given array Input: 44, 6, 7, 100, 564, 3, 44, 2, 5, 44, 200 Element to be found: 44 Output: Element 44 is found at index 0, 6, 9
Java-.Selection and insertion sort 3.a Show steps of selection sort for the given array. You may need to add more rows to the table. Selection Sort Initial value 3 2 7 5 4 8 9 10 1 Search 0 . . . end 3 2 7 5 4 8 9 10 1 Swap index 0 Search 1 . . . end . . . 3.b Show steps of insertion sort for the given array. You may need to add more rows to the table. Insertion Sort Initial value 3 2 7 5 4 8 9 10 1 , first item is sorted 3 2 7 5 4 8 9 10 1 , first 2 items are…
6. Read in two integers n and m (n, m < 50). Read n integers in an array A. Read m integers in anarray B. Then do the following (write separate programs for each, only the reading part iscommon).a) Find if there are any two elements x, y in A and an element z in B, such that x + y = z.b) Copy in another array C all elements that are in both A and B (intersection).c) Copy in another array C all elements that are in either A and B (union).d) Copy in another array C all elements that are in A but not in B (difference).Do In c Program
Complete the following function definition to recursively print the index of a unique value in an array or -1 if the value is not found:1 int getIndex(int *a, int s, int v) {2 if( ) { // if no values are found3 4 }5 if(a[s-1] == v) { // if a value is found6 7 }8 return getIndex( ); // recurse to check next value9 }Hint:Recurse through the array by counting down from size. 1. Complete the one line of code for line 2:2. Write one line of code for line 3:3. Write one line of code for line 6:4. Complete the one line of code for line 8: please send an atom code. not other software
Section A: Multiple Choice Questions : Q1: Consider searching element 45 using binary search in an array A [ ] = { 23, 34, 45, 67, 78, 54, 87, 91 }. The returned index would be a) Index [0] b) Index [2] c) Index [3] d) None of these Q2: In the context of recursive search a) Recursion terminates when the item is found b) Same function is called again and again c) Slower than iterative search d) All options are correct Q3: Which one of the following is an approach for a systematic trial and error to search an item? a) Binary search b) Backtracking c) Recursion d) Iteration Q4: In terms of time efficiency, the following method is ____. public int function(int n) { int result = 1; for (int k = 1; k returnType methodName(methodParameters) c) methodModifiers returnType methodName (methodParameters) d) methodModifiers returnType methodName(methodParameters) Q8: Given a function f(n) = n2 + 20n on an input parameter n, which of the following is true a) f(n)=O(1) b) f(n)=O(n) c)…