Problem Description Use this project to write and run a C program that performs the following: O Creates 6-element 1-D integer array named Numbers. O O O O O O Fill the array with random values between (2 and 12), each run should give new random values. and prints them in tabular format as in the sample output Pass the array to a function called findHighest that finds the maximum number in the array recursively and return it to the main. (don't use predefined functions to find the max) Pass the array to function called find Lowest that finds the minimum number in the array I recursively and return it to the main. (don't use predefined functions to find the min) Pass the max and min numbers to a recursive function called findGCD that finds the Greatest Common Divisor (GCD) and return it to the main. Note: Greatest Common Divisor (GCD) for two positive integers a and b is the largest number d such that a/d and b/d doesn't have any remainder. For example GCD(63) 3 and GCD(6 10) = 2 Pass the max and min numbers to a recursive function called intDivision, which finds and returns the result of dividing the max with the min. The main function Prints the values of the maximum, minimum the GCD and the division in tabular form as shown in the sample output.
Problem Description Use this project to write and run a C program that performs the following: O Creates 6-element 1-D integer array named Numbers. O O O O O O Fill the array with random values between (2 and 12), each run should give new random values. and prints them in tabular format as in the sample output Pass the array to a function called findHighest that finds the maximum number in the array recursively and return it to the main. (don't use predefined functions to find the max) Pass the array to function called find Lowest that finds the minimum number in the array I recursively and return it to the main. (don't use predefined functions to find the min) Pass the max and min numbers to a recursive function called findGCD that finds the Greatest Common Divisor (GCD) and return it to the main. Note: Greatest Common Divisor (GCD) for two positive integers a and b is the largest number d such that a/d and b/d doesn't have any remainder. For example GCD(63) 3 and GCD(6 10) = 2 Pass the max and min numbers to a recursive function called intDivision, which finds and returns the result of dividing the max with the min. The main function Prints the values of the maximum, minimum the GCD and the division in tabular form as shown in the sample output.
C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter8: Arrays And Strings
Section: Chapter Questions
Problem 44SA
Related questions
Question
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 1 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr
Microsoft Visual C#
Computer Science
ISBN:
9781337102100
Author:
Joyce, Farrell.
Publisher:
Cengage Learning,
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr
Microsoft Visual C#
Computer Science
ISBN:
9781337102100
Author:
Joyce, Farrell.
Publisher:
Cengage Learning,