Write a recursive function that returns both the smallest and the largest element in an int array. Also, write a program to test your function.

write a c++ program: Create an array with 11 integers, which will be randomly selected from the range of 0 to 100. Print the items of the array on screen as one line. Develop a function that takes the array as argument and perform these operations: -Find the minimum of array items and replace (swap) with first item of the array. -Find the maximum of array items and replace (swap) with last item of the array. -Find the average of array’s items and assign it to middle location of the array. The average of numbers should be calculated as an integer. (hint: static_cast<int>(float))

Modify the recursive Fibonacci function to employ the memoization technique discussed in this chapter. The function creates a dictionary and then defines a nested recursive helper function named memoizedFib. You will need to create a dictionary to cache the sum of the fib function. The base case of the fib function is the same as before. However, before making any recursive calls, the helper function looks up the value for the function’s current argument in the dictionary (use the method get, with None as the default value). If the value exists, the function returns it and skips any recursive calls. Otherwise, after the helper function adds the results of its two recursive calls, it saves the sum in the dictionary with the current argument of the function as the key. Note: The program should output in the following format: n      fib(n) 2       1 4       3 8       21 16      987 32      2178309 ---------------------------------------------------------------------------------- def…

Use C++

Write a recursive function that accepts a number and returns its factorial. b. Write a recursive function that accepts an array, its size and the index of the initial element as arguments. The function fills the array with the elements of the following sequence: n1 = 3, nk+1 = nk+35 c. Write an iterative and a recursive versions of the binary search. In C++ coding

Write a RECURSIVE function, without using any loops, that prints the contents of a matrix with 3 columns.  The function should take the matrix and the number of rows as arguments. void print_matrix(int arr[][3], int num_rows);

Please complete this program in C++ Please enusre that there is plenty of comments. PLENTY even if unessessary. Please include screenshots of actual code, screenshots of output, and code in the browser so I can copy and paste. Thank you.

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.

You are designing a function that will manipulate an array of integers. It needs to work for arrays of any length. What is the minimum number of parameters your function will have?

What does "base address of an array" mean, and how does it come into play in a function call?