Using recursion, write a Java program that creates an array of 10 numbers entered by the user. The recursive function receives the array and the position of the starting point of the array. The function returns the index of the smallest element of the array. The main method outputs the smallest of these numbers using the returned index.

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);

Write a Java to do the following USING ARRAYS (NO HARD CODING) MUST USE METHODS Arrays And Functions (Methods) hint write and test one module at the time 1) Input 15 integers (input validation , all numbers must be between -20 and 50 inclusive ) ,create a method/function. 2 methods/functions one for inputand one for input validation 2) Find and display all negative number in the array, create a method/function. 3) Display every other element in the array, create a method/function 4) Find the Sum of all positive numbers in the Array, create a method/function 5) a method/function to display the original array 6) include a menu using the switch statement to enable the user to select one of the the options (2,3,4). 7) include a loop to restart the menu

C Programming Language Note: Input and Output Must be the same Write in C Language

c programming Task 3: Complete armstrong_task3.c by implementing armstrong_recursive function. int armstrong_recursive (int arm); It performs same operation as in Task 1, however in a recursive manner. A number to be checked whether it is armstrong or not is given as an input and the function returns the summation of the digits. If the returned value is equal to the given input value then it is an armstrong number.