← Back to Functions/Methods
Question 122
Function: Recursive Sum to N
Function: Recursive Sum to N
Complete the function sumTo so it returns the sum of all integers from 1 to n using RECURSION (no loops). The main function reads n and prints the sum. Base case:sumTo(0)is 0. Recursive case:sumTo(n)= n +sumTo(n - 1).
Expected Output:
55= newline. No newline after the last line.
Hints2 available
Sign in to use hintsTopics:
Functions/Methods
1
Tab to indent (Esc then Tab to move on) · Ctrl+Enter to run · Shift+Alt+F to format · Ctrl+Space to expand shortcuts (p, fori)
Your Output
Run your code to see the output here...
Test Cases
Run your code to see test case results.