id/email
password
forgot password | create account
about | help | code help+videos | done | prefs
CodingBat code practice

 

recur_sumOneToN


Given an integer "n", recursively calculate the sum of all numbers from 1 up to "n". For example, if "n" is 5, then you should calculate 1+2+3+4+5 which is 15.


recur_sumOneToN(1) → 1
recur_sumOneToN(2) → 3
recur_sumOneToN(3) → 6

...Save, Compile, Run (ctrl-enter)

public int recur_sumOneToN(int n) { }

Editor font size %:
Shorter output


Forget It! -- delete my code for this problem

Progress graphs:
 Your progress graph for this problem
 Random user progress graph for this problem
 Random Epic Progress Graph

Java Help

Misc Code Practice

Post-solution available

Copyright Nick Parlante 2017 - privacy