Q3. Trace the following code and write the output and mention what the code does int algorithm(int arr(), int I, int r, int x) { if (r >= 1) { int mid = |+ (r - 1) / 2 if (arr[mid] == x) return mid if (arr[mid] > x) return algorithm(arr, I, mid - 1, x) return algorithm(arr, mid + 1, r, x) return -1 int main(void) { int arr[] = { 2, 3, 4, 10, 40, 7, 9, 11)} int n = sizeof(arr)/ sizeof(arr[0]) int x = 11 int output = algorithm(arr, 0, n - 2, x) (output == -1) ? printf(" 11 is not found in the list") : printf("11 is found at index %d", output) return 0

Q3. Trace the following code and write the output and mention what the code does int algorithm(int arr(), int I, int r, int x) { if (r >= 1) { int mid = |+ (r - 1) / 2 if (arr[mid] == x) return mid if (arr[mid] > x) return algorithm(arr, I, mid - 1, x) return algorithm(arr, mid + 1, r, x) return -1 int main(void) { int arr[] = { 2, 3, 4, 10, 40, 7, 9, 11)} int n = sizeof(arr)/ sizeof(arr[0]) int x = 11 int output = algorithm(arr, 0, n - 2, x) (output == -1) ? printf(" 11 is not found in the list") : printf("11 is found at index %d", output) return 0

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

Given an integer array of positive single digit values such as:int a[] = {8,4,2,6,9};1) Write a recursive arrayToN function which returns the concatenation of all array values as an integer value.This function should accept all required data as parameters and return a long integer value.ExamplesIf the array is 8 4 2 6 9 the arrayToN function returns the integer 84269.If the array is 0 2 6 8 9 3 5 1 the arrayToN function returns the integer 2689351.
please code in python Write a recursive function to add a positive integer b to another number a, add(a, b), where only the unit 1 can be added, For example add(5, 9) will return 14. The pseudocode is: # Base case: if b is 1, you can just return a + 1 # General case: otherwise, return the sum of 1 and what is returned by adding a and b - 1.
Write a recursive function that adds all the elements in an array. The function will take two arguments, 1) An integer value that is greater than 0 and indicates the size of the array, and 2) An integer array of that size. The function should return an integer value that is the sum of the elements in the array. The function should add elements of the input array using recursion and should not use a loop.ii) Read both a string and the key (integer) is entered through the keyboard. Define a function to encrypt each and every character in a string with the given key. As a programmer, implement the same by writing the C code using pointers. If the given Key is positive, then traverse towards left of the character in the Alphabet sequence. Otherwise, move traverse towards the right of the character in the Alphabet sequence. Example : if the given string is "PRADEEP" and Key = 3 then the encrypted string is "SUDGHHS" iii) An ISBN (International Standard Book Number) is a 10 digit number…
I need the code from start to end with no errors and the explanation for the code ObjectivesJava refresher (including file I/O)Use recursionDescriptionFor this project, you get to write a maze solver. A maze is a two dimensional array of chars. Walls are represented as '#'s and ' ' are empty squares. The maze entrance is always in the first row, second column (and will always be an empty square). There will be zero or more exits along the outside perimeter. To be considered an exit, it must be reachable from the entrance. The entrance is not an exit.Here are some example mazes:mazeA7 9# # ###### # # ## # # #### # ## ##### ## ########## RequirementsWrite a MazeSolver class in Java. This program needs to prompt the user for a maze filename and then explore the maze. Display how many exits were found and the positions (not indices) of the valid exits. Your program can display the valid exits found in any order. See the examples below for exact output requirements. Also, record…
1. Consider the following recursive function: def foo(n): if (n == 0): return 0 return n + foo(n - 1)a. What is foo(5) b. What is foo(10) c. Suppose that n + foo(n - 1) is changed to n * foo(n - 1). What is foo(5) now? d. What happens if foo(-1) is called?
Write a recursive algorithm with the following prototype: int divide (int x, int y); that returns x/y (integer division). You need not test for divide by 0. THE FUNCTION MUST BE RECURSIVE. (hint: base case should be when x
CodeW For fun X C Solved https://codeworkou... 臺亂 CodeWorkout X272: Recursion Programming Exercise: Is Reverse For function isReverse, write the two missing base case conditions. Given two strings, this function returns true if the two strings are identical, but are in reverse order. Otherwise it returns false. For example, if the inputs are "tac" and "cat", then the function should return true. Examples: isReverse("tac", "cat") -> true Your Answer: 1 public boolean isReverse(String s1, String s2) { 2. if > 3. 4. else if > return true; return false; 5. 6. else { String s1first = String s2last return s1first.equals (s2last) && 51. substring(0, 1); s2, substring(s2.length() 1); 7. 8. 6. isReverse(s1.substring(1), s2.substring(0, s2.length() 1)); { 12} 1:11AM 50°F Clear 12/4/2021
Write a recursive function that, given a sequence of comparable values, returns the count of elements where the current element is less than the following ( next ) element in the given sequence. See the examples given below. def count_ordered ( seq ) : """ Input : A sequence of comparable elements Output : The number of elements that are less than the following element in the sequence Example : >>> count_ordered ( [ 1 , 2 , 3 , 4 , 5 , 6 ] ) 5 >>> count_ordered ( ( 1 , 12, 7.3 , -2,4 ) ) 2 >>> count_ordered ( 'Python' ) 2 >>> count_ordered ( [ 6 ] ) 0 >>> count_ordered ( [ ] ) 0 """ In the first example above , count_ordered ( [ 1,2,3,4,5,6 ] )the returned answer is 5 because for all the first 5 numbers the current number is less than the next number. In the second example above, count_ordered ( ( 1,12,7.3 , -2,4 ) )the…
int getMax(int arr[], int n) { intmx=arr[0]; for (inti=1; i<n; i++) if (arr[i] >mx) mx=arr[i]; returnmx; } Can u give me the code for this one as well....this is the first function and countsort is the second
Artificial Intelligence (Part - 1) ==================== The Towers of Hanoi is a famous problem for studying recursion in computer science and searching in artificial intelligence. We start with N discs of varying sizes on a peg (stacked in order according to size), and two empty pegs. We are allowed to move a disc from one peg to another, but we are never allowed to move a larger disc on top of a smaller disc. The goal is to move all the discs to the rightmost peg (see figure). To solve the problem by using search methods, we need first formulate the problem. Supposing there are K pegs and N disk. (1) Propose a state representation for the problem?
Below is the recursive implementation of binary search from lab with one change (in red): the print statement at the top of the function which prints "BOO" There is also a main function which calls bsearchR on the sorted array data[] with 7 elements and searching for 10. QUESTION: How many BOOS will be printed by this program? // Recursive Binary Search Routine that does the "Real" Work int bsearchR(int a[], int lo, int hi, int x) { int m; printf("BO0\n"); // <<<<==== NEW STATEMENT if(hi < lo) return -1; m = (lo + hi) / 2; if(a[m] == x) return m; else if(x < a[m]) return bsearchR(a, lo, m-1, x); else return bsearchR(a, m+1, hi, x); } int main() { int data[] = {5, 8, 12, 15, 20, 25, 30}; int idx = bsearchR(data, e, 6, 10); return 0; }