Write a program to track and display rainfall for each month for 5 years (2010 - 2014).
Use a...
Computers and Technology, 23.03.2020 16:56 zackinator9226
Write a program to track and display rainfall for each month for 5 years (2010 - 2014).
Use a 2 dimensional array to store the rainfall for each month (5 rows (for the years) and 12 columns (for the months)).
Using an initializer list, populate the array with the below data.
Display the table of the rainfall values for the 5 years and 12 months (as shown below). Then, total and display the rainfall for each year, and calculate and display the average rainfall for each month.
Hint: When totaling the rainfall for each month (to calculate the average), use an outer loop to loop through the months first, and an inner loop to loop through the years.
There is nothing entered by the user.
Exactly how output should look:
Jan Feb Mar Apr May Jun Jul Aug Sep Oct Nov Dec
2010 0.88 1.11 2.01 3.64 6.44 5.58 4.23 4.34 4.00 2.05 1.48 0.77
2011 0.76 0.94 2.09 3.29 4.68 3.52 3.52 4.82 3.72 2.21 1.24 0.80
2012 0.67 0.80 1.75 2.70 4.01 3.88 3.72 3.78 3.55 1.88 1.21 0.61
2013 0.82 0.80 1.99 3.05 4.19 4.44 3.98 4.57 3.43 2.32 1.61 0.75
2014 0.72 0.90 1.71 2.02 2.33 2.98 2.65 2.99 2.55 1.99 1.05 0.92
Total rainfall for each year:
2010 xx. xx
2011 xx. xx
2012 xx. xx
2013 xx. xx
2014 xx. xx
Average rainfall for each month:
Jan Feb Mar Apr May Jun Jul Aug Sep Oct Nov Dec
x. xx x. xx x. xx x. xx x. xx x. xx x. xx x. xx x. xx x. xx x. xx x. xx
Answers: 1
Computers and Technology, 21.06.2019 19:30
Which of the following are types of formatting you can apply to a spreadsheet? choose all that apply.
Answers: 3
Computers and Technology, 22.06.2019 01:00
)a grad student comes up with the following algorithm to sort an array a[1..n] that works by first sorting the first 2/3rds of the array, then sorting the last 2/3rds of the (resulting) array, and finally sorting the first 2/3rds of the new array. 1: function g-sort(a, n) . takes as input an array of n numbers, a[1..n] 2: g-sort-recurse(a, 1, n) 3: end function 4: function g-sort-recurse(a, `, u) 5: if u ⒠` ≤ 0 then 6: return . 1 or fewer elements already sorted 7: else if u ⒠` = 1 then . 2 elements 8: if a[u] < a[`] then . swap values 9: temp ↠a[u] 10: a[u] ↠a[`] 11: a[`] ↠temp 12: end if 13: else . 3 or more elements 14: size ↠u ⒠` + 1 15: twothirds ↠d(2 ◠size)/3e 16: g-sort-recurse(a, `, ` + twothirds ⒠1) 17: g-sort-recurse(a, u ⒠twothirds + 1, u) 18: g-sort-recurse(a, `, ` + twothirds ⒠1) 19: end if 20: end function first (5 pts), prove that the algorithm correctly sorts the numbers in the array (in increasing order). after showing that it correctly sorts 1 and 2 element intervals, you may make the (incorrect) assumption that the number of elements being passed to g-sort-recurse is always a multiple of 3 to simplify the notation (and drop the floors/ceilings).
Answers: 3
Computers and Technology, 23.06.2019 03:30
Many everyday occurrences can be represented as a binary bit. for example, a door is open or closed, the stove is on or off, and the fog is asleep or awake. could relationships be represented as a binary value? give example.
Answers: 1
Computers and Technology, 24.06.2019 21:30
The hybrid uses 144 to 158 volt batteries.
Answers: 1
Computers and Technology, 03.12.2020 19:50
Computers and Technology, 03.12.2020 19:50
Mathematics, 03.12.2020 19:50
Physics, 03.12.2020 19:50
Mathematics, 03.12.2020 19:50
Mathematics, 03.12.2020 19:50
Computers and Technology, 03.12.2020 19:50
Social Studies, 03.12.2020 19:50
Mathematics, 03.12.2020 19:50
Mathematics, 03.12.2020 19:50
Mathematics, 03.12.2020 19:50
History, 03.12.2020 19:50
Chemistry, 03.12.2020 19:50