← Back to Recursion
Question 599
Sum Between Two Numbers
Sum Between Two Numbers
Complete sum_range(low: int, high: int) -> int so it returns the sum of every whole number from low up to and including high, by recursion. The base case is written: when low is greater than high the range is empty and the sum is 0. Add the recursive case, which returns low plus the sum of the range that starts at low + 1 and keeps the same high. Do NOT write a main block or any top-level test code; the tests construct the calls. Input: two lines, low then high, no prompts, which the tests read and pass to your function before printing the value it returns.
Expected Output:
18= newline. The output ends with a newline — print one after the last line.
Hints2 available
Sign in to use hintsTopics:
Recursion
1
Tab to indent (Esc then Tab to move on) · Ctrl+Enter to run · Ctrl+Space to expand shortcuts (pr, inp, def)
Your Output
Run your code to see the output here...
Test Cases
Run your code to see test case results.