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 public int triangle(int rows) { } See Also: Example Code Java help: If Boolean Logic | Strings | While and For Loops | Arrays and Loops prev  |  next  |  chance   |  JavaBat  >  Recursion-1

Forget It! -- delete my code for this problem 315.0

Copyright Nick Parlante 2006-09 - privacy