Number Analysis Program Program plan: Include required header files Give the “main ()” function. Declare required variables. Loop for 0 through 19 using “for” loop. Get the numbers and store them in the array “xarray[]”. Loop for 0 through 19 using “for” loop. Total the array values and store it in a variable “sum”. Calculate average and store it in the variable “average”. Assign “xarray [0]” to the variable “high”. Loop for 0 through 19 using “for” loop. Check if the value is greater than the “high”. Get the highest number and store it in the variable “high”. Assign “xarray [0]” to the variable “low”. Loop for 0 through 19 using “for” loop. Check if the value is lesser than the “low”. Get the lowest rainfall and store it in the variable “low”. Print all the results.

Question

Want to see the full answer?

Answer 1

Question

Chapter 8, Problem 4PE

Program Plan Intro

Number Analysis Program

Program plan:

Include required header files

Give the “main ()” function.

Declare required variables.

Loop for 0 through 19 using “for” loop.

Get the numbers and store them in the array “xarray[]”.

Loop for 0 through 19 using “for” loop.

Total the array values and store it in a variable “sum”.

Calculate average and store it in the variable “average”.

Assign “xarray [0]” to the variable “high”.

Loop for 0 through 19 using “for” loop.

Check if the value is greater than the “high”.

Get the highest number and store it in the variable “high”.

Assign “xarray [0]” to the variable “low”.

Loop for 0 through 19 using “for” loop.

Check if the value is lesser than the “low”.

Get the lowest rainfall and store it in the variable “low”.

Print all the results.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Please no AI! Or if you do use AI, Check the work please! Thank you!

(Dynamic Programming.) Recall the problem presented in Assign- ment 3 where given a list L of n ordered integers you're tasked with removing m of them such that the distance between the closest two remaining integers is maxi- mized. See Assignment 1 for further clarification and examples. As it turns out there is no (known) greedy algorithm to solve this problem. However, there is a dynamic programming solution. Devise a dynamic programming solution which determines the maximum distance between the closest two points after removing m numbers. Note, it doesn't need to return the resulting list itself. Hint 1: Your sub-problems should be of the form S(i, j), where S(i, j) returns the maximum distance of the closest two numbers when only considering removing j of the first i numbers in L. As an example if L [3, 4, 6, 8, 9, 12, 13, 15], then S(4, 1) = 2, since the closest two values of L' = [3,4,6,8] are 6 and 8 after removing 4 (note, 8-6 = = 2). = Hint 2: For the sub-problem S(i, j),…

(Dynamic Programming.) A group of friends is visiting a number of attractions located along a highway, starting at kilometre 0, placed at distances ɑ1 < A2 < ···