Answer:
void mn(int m, int n){
int sum = 0;
int count = 0;
if(m<n){
for(int i = m;i<=n;i++){
sum+=i;
}
}
else{
for(int i = n;i<=m;i++){
sum+=i;
}
}
count = abs(m - n)+1;
cout<<"Sum: "<<sum<<endl;
cout<<"Average: "<<(float)sum/count;
}
Explanation:
This line defines the method
void mn(int m, int n){
This initializes sum and count to 0
int sum = 0;
int count = 0;
This checks if m is less than n
if(m<n){
This iterates from m to n and calculates the sum of numbers between this interval
<em> for(int i = m;i<=n;i++){</em>
<em> sum+=i;</em>
<em> }</em>
<em> }</em>
If otherwise,
else{
This iterates from n to m and calculates the sum of numbers between this interval
<em> for(int i = n;i<=m;i++){</em>
<em> sum+=i;</em>
<em> }</em>
<em> }</em>
This calculates the range from m to n using absolute function
count = abs(m - n)+1;
This prints the calculated sum
cout<<"Sum: "<<sum<<endl;
This calculates and prints the average
cout<<"Average: "<<(float)sum/count;
}
<em>See attachment for complete program that includes the main (in c++)</em>
Answer:
#include <stdio.h>
int fib(int n) {
if (n <= 0) {
return 0;
}
if (n <= 2) {
return 1;
}
return fib(n-1) + fib(n-2);
}
int main(void) {
for(int nr=0; nr<=20; nr++)
printf("Fibonacci %d is %d\n", nr, fib(nr) );
return 0;
}
Explanation:
The code is a literal translation of the definition using a recursive function.
The recursive function is not per se a very efficient one.
Um.. Where the Answer Choices
C. Set up a slide show. Slide shows allow the most room for explanation and information when it comes to live presentations.
