What is the return value of the function call BS(array, 0, 9, 45), where array is an array declared as int array[]={3, 10, 13, 20, 35, 45, 67, 77, 82, 90}; The recursive function BS is defined as: int BS(int array[], int first, int last, int value) { int mid; if (first > last) return -1; else { mid = (first + last) / 2; if (value == array[mid]) return mid; else if (value < array[mid]) return BS(array, first, mid - 1, value); else if (value > array[mid]) return BS(array, mid + 1, last, value); } } Question 9 options: 2 3 8 5

What is the return value of the function call BS(array, 0, 9, 45), where array is an array declared as int array[]={3, 10, 13, 20, 35, 45, 67, 77, 82, 90}; The recursive function BS is defined as: int BS(int array[], int first, int last, int value) { int mid; if (first > last) return -1; else { mid = (first + last) / 2; if (value == array[mid]) return mid; else if (value < array[mid]) return BS(array, first, mid - 1, value); else if (value > array[mid]) return BS(array, mid + 1, last, value); } } Question 9 options: 2 3 8 5

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 1TF

See similar textbooks

Similar questions

Compute the sum of all elements of an array1. Describe the definition of recursive function Base case(s) Recursive case(s) 2. Write the code.
Consider the following function: void fun_with_recursion(int x) { printf("%i\n", x); fun_with_recursion(x + 1); } What will happen when this function is called by passing it the value 0?
C programming Language Recursion Question 1: Write c program to print the sum of the array elements using recursive function. You should have the main function + function to find the summation. Question 2: Write recursive function that returns the value of the following recursive definition: f(x) = 0 if x<= 0 f(x-1 )+ 2 otherwise You should have the main function + the recursive function.
Reversing an Array1. Describe the definition of recursive function.oBase case(s)oRecursive case(s)2. Write the code.
Create a recursive function that simulates the range function. For example: Enter the range (begin, end, increment) separated by spaces: 3 15 3 [3,6,9,12]
Recursive Sum! Write a recursive function rc_sum(n:int) -> int that returns the sum of the first n positive integers. The function should look very similar to the factorial function you have seen before. Your Answer: 1 # Put your answer here 2 Submit
Part 2: Recursive Fractals Examine this pattern of asterisks and blanks, and write a recursive function called pattern() that can generate patterns such as this: pattern(3, 2); pattern(5, 1); pattern(7, 0); With recursive thinking, the function needs only about 10 lines of code (including two recursive calls). Your function prototype should look like this: // Description: I/ The longest line of the pattern has n stars beginning in column col of the output. // Precondition: n is an positive odd number. // Postcondition: A pattern based on the above example has been printed. void pattern (int n, int col); No error handling needed for this part. Assume that user will provide you a positive odd int as n, and a non-negative int as col. Hint: Think about how the pattern is a fractal. Can you find two smaller versions of the pattern within the large pattern? Here is some code that may be helpful within your function: // A loop to print exactly col columns for (int i = 0; i < col; i++) cout <«…
Programming Language: C Write the following three functions: a) The function gets an array A of length n of ints, and a boolean predicate pred. It returns the smallest index i such that pred(A[i])==true. If no such element is not found, the function returns -1. int find(int* A, int n, bool (*pred)(int)); b) The function gets an array A of length n of ints, and a function f. It applies f to each element of A. void map(int* A, int n, int (*f)(int)); c) The function gets an array A of length n of ints, and a function f. The function f gets 2 ints and works as follows: 1. Start with accumulator = A[0] 2. For i=1...length-1 compute accumulator=f(accumulator, A[i]) 3. Return accumulator For example, if f computes the sum of the two inputs, then reduce() will compute the sum of the entire array. int reduce(int* A, int n, int (*f)(int,int)); Test for the functions: // used for test Q3-find bool is_even(int x) { return x%2 == 0; } bool is_positive(int x) { return x>0; } void…
Write a recursive boolean function named isMember. The function should accept three parameters: an array of integers, an integer indicating the number of elements in the array, and an integer value to be searched for. The function should return true if the value is found in the array, or false if the value is not found. Demonstrate the use of the function in a program that asks the user to enter an array of numbers and a value to be searched for
In C programming: Write a function printAllCourses() which receives an array of course pointers and the array’s size, then prints all courses in the array by calling printCourseRow()
C++ Coding: ArraysTrue and False Code function definitions for eoNum() and output(): Both eoNum() and output() are recursive functions. output() stores the even/odd value in an array. Store 0 if the element in the data array is even and store 1 if the element in the data array is odd. eoNum() displays all the values in an array to the console.
function myCompose(f,g){// TODO: return (f o g);// that is, a function that returns f(g(x)) when invoked on x.}