| about | help | code help+videos | done | prefs |
Java > Recursion-1 > triangle
prev | next | chance
| We have triangle made of blocks. The topmost row has 1 block, the next row down has 2 blocks, the next row has 3 blocks, and so on. Compute recursively (no loops or multiplication) the total number of blocks in such a triangle with the given number of rows.
triangle(0) → 0 triangle(1) → 1 triangle(2) → 3 ...Save, Compile, Run prev | next | chance | CodingBat > Recursion-1 |
Progress graphs, just for fun:
Your progress graph for this problem
Random user progress graph for this problem
Random Epic Progress Graph
315.0 Post-solution available
Copyright Nick Parlante 2006-11 - privacy