Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
c program Exercise 1- Exercise Objectives Recursive Array Processing 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 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 o 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) o Pass the array to function called find Lowest that finds the minimum 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 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 (6,3) 3 and GCD(6,10) 2. o 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. o The main function Prints the values of the maximum, minimum the GCD and the division in tabular form as shown in the sample output. Sample Output The array has been filled with 6 random numbers as following: Index value 08 13 24 3 12 4 10 56 The Maximum number is : 12 The Minimum number is : The GCD is : 3 The int divison is 41

c program Exercise 1- Exercise Objectives Recursive Array Processing 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 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 o 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) o Pass the array to function called find Lowest that finds the minimum 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 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 (6,3) 3 and GCD(6,10) 2. o 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. o The main function Prints the values of the maximum, minimum the GCD and the division in tabular form as shown in the sample output. Sample Output The array has been filled with 6 random numbers as following: Index value 08 13 24 3 12 4 10 56 The Maximum number is : 12 The Minimum number is : The GCD is : 3 The int divison is 41

C++ Programming: From Problem Analysis to Program Design
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 16PE
See similar textbooks
icon
Related questions
Question
c program Exercise 1- Exercise Objectives Recursive Array Processing 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 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 o 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) o Pass the array to function called find Lowest that finds the minimum number in the array recursively and return it to the main. (don't use predefined functions to find the min) findGCD that finds the Greatest Common Divisor (GCD) and return it to the main. o Pass the max and min numbers to a recursive function called Note: Greatest Common Divisor (GCD) for two positive integers For example a and b is the largest number d such that a/d and b / d doesn't have any remainder. GCD (6,3)= 3 and GCD (6,10) = 2. o 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. o The main function Prints the values of the maximum, minimum the GCD and the division in tabular form as shown in the sample output. Sample Output The array has been filled with 6 random numbers as following : Index value 08 13 24 3 12 4 10 56 The Maximum number is : 12 The Minimum number is : 3 The GCD is : 3 The int divison is : 4
Transcribed Image Text:c program Exercise 1- Exercise Objectives Recursive Array Processing 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 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 o 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) o Pass the array to function called find Lowest that finds the minimum number in the array recursively and return it to the main. (don't use predefined functions to find the min) findGCD that finds the Greatest Common Divisor (GCD) and return it to the main. o Pass the max and min numbers to a recursive function called Note: Greatest Common Divisor (GCD) for two positive integers For example a and b is the largest number d such that a/d and b / d doesn't have any remainder. GCD (6,3)= 3 and GCD (6,10) = 2. o 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. o The main function Prints the values of the maximum, minimum the GCD and the division in tabular form as shown in the sample output. Sample Output The array has been filled with 6 random numbers as following : Index value 08 13 24 3 12 4 10 56 The Maximum number is : 12 The Minimum number is : 3 The GCD is : 3 The int divison is : 4
Expert Solution
steps

Step by step

Solved in 3 steps with 3 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Array
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.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
C++ for Engineers and Scientists
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr
Programming Logic & Design Comprehensive
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage
Microsoft Visual C#
Microsoft Visual C#
Computer Science
ISBN:
9781337102100
Author:
Joyce, Farrell.
Publisher:
Cengage Learning,
Systems Architecture
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning
EBK JAVA PROGRAMMING
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT
SEE MORE TEXTBOOKS