Question

1. Write a recursive function that accepts an integer argument and returns the sum of all the integers from 1 up to the number passed as an argument. For example, if 50 is passed as an argument, the method will return the sum of 1, 2, 3, 4,... 50. Demonstrate the method in a program. 2. Write a recursive function that raises a number to a power. The function should accept two arguments: the number to be raised and the exponent. Assume that the exponent is a nonnegative integer. Demonstrate the method in a program. 3. Write a recursive function that accepts two arguments into the parameters X and Y. The function should return the value of X times Y. Remember, multiplication can be performed as repeated addition: 7*4=4+4+4+4+4+4+4 4. Write an iterative version (using a loop instead of recursion) of the factorial function shown in the lecture (Slide 11). Demonstrate the use of the function in a program that prints the factorial of a number entered by the user. 5. Write an iterative version of the gcd function shown in the lecture (Slide 14). Demonstrate the use of the function in a program that prints the greatest common divisor of two numbers entered by the user.

          1. Write a recursive function that accepts an integer argument and returns the sum of all the integers from
1 up to the number passed as an argument. For example, if 50 is passed as an argument, the method will
return the sum of 1, 2, 3, 4,... 50. Demonstrate the method in a program.
2. Write a recursive function that raises a number to a power. The function should accept two arguments:
the number to be raised and the exponent. Assume that the exponent is a nonnegative integer.
Demonstrate the method in a program.
3. Write a recursive function that accepts two arguments into the parameters X and Y. The function should
return the value of X times Y. Remember, multiplication can be performed as repeated addition:
7*4=4+4+4+4+4+4+4
4. Write an iterative version (using a loop instead of recursion) of the factorial function shown in the
lecture (Slide 11). Demonstrate the use of the function in a program that prints the factorial of a number
entered by the user.
5. Write an iterative version of the gcd function shown in the lecture (Slide 14). Demonstrate the use of the
function in a program that prints the greatest common divisor of two numbers entered by the user.

1. Write a recursive function that accepts an integer argument and returns the sum of all the integers from
1 up to the number passed as an argument. For example, if 50 is passed as an argument, the method will
return the sum of 1, 2, 3, 4,... 50. Demonstrate the method in a program.
2. Write a recursive function that raises a number to a power. The function should accept two arguments:
the number to be raised and the exponent. Assume that the exponent is a nonnegative integer.
Demonstrate the method in a program.
3. Write a recursive function that accepts two arguments into the parameters X and Y. The function should
return the value of X times Y. Remember, multiplication can be performed as repeated addition:
7*4=4+4+4+4+4+4+4
4. Write an iterative version (using a loop instead of recursion) of the factorial function shown in the
lecture (Slide 11). Demonstrate the use of the function in a program that prints the factorial of a number
entered by the user.
5. Write an iterative version of the gcd function shown in the lecture (Slide 14). Demonstrate the use of the
function in a program that prints the greatest common divisor of two numbers entered by the user.

Added by Robert B.

Question

Please give Ace some feedback