Question: Recursive Array Processing Problem Description Use this project to write and run a C program that performs the following: eged array amedrandum.. o fill the
Recursive Array Processing Problem Description Use this project to write and run a C program that performs the following: eged array amedrandum.. o fill the array with random values between (3 and 21), each run should give new random values and prints them in tabular format as in the sample output o pass the array to a function called findEvenMax() that finds the maximum even number in the array recursively and return it to the main. (don't use predefined functions to find the max) o Pass the array to function called findEven Min() that finds the minimum even number in the array recursively and return it to the main (don't use predefined functions to find the min) o pass the max and min numbers to a recursive function called findLCFC) that finds the lowest Common Factor (LCF) not equal to one and return it to the main Note: Lowest Common Factor (LCF) for two positive integers pand is the lowest number fsuch that p/fand g/f doesn't have any remainder. . For example LCF(12, 6) = 2 and LCF(18,9) = 3. The main function Prints the values of the maximum, minimum, and the LCF in a tabular form as I shown in the sample output Sample Output The array has been filled with 8 random numbers as following: Index 0 1 2 value 7 3 4 14 10 19 9 15 6 7 Max Even Min Even LCF 14 4 2
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
