Triangular numbers : Stack « Collections Data Structure « Java

Triangular numbers

     
import java.io.IOException;

public class Triangle {

  public static void main(String[] args) throws IOException {
    int theNumber = 100;
    int theAnswer = triangle(theNumber);
    System.out.println("Triangle=" + theAnswer);
  }

  public static int triangle(int n) {
    if (n == 1)
      return 1;
    else
      return (n + triangle(n - 1));
  }

}

1.	Demonstration of Stack Class
2.	Stack in java.util
3.	Stack data structure
4.	Bracket Checker
5.	String Reverser Through Stack
6.	Link stack
7.	Triangular numbers with stack replaces recursion
8.	Show String Reversals
9.	Generic stack demo with annotation
10.	Character Stack
11.	A faster, smaller stack implementation.
12.	Growable Object stack with type specific access methods
13.	Growable int stack with type specific access methods
14.	Stack for boolean values
15.	extends ArrayList to create Stack
16.	Growable String stack with type specific access methods.
17.	A simple integer based stack.
18.	A very simple unsynchronized stack. This one is faster than the java.util-Version.
19.	Pop an empty stack ntry times and catch the resulting exception
20.	Object Stack
21.	Fast stack

Triangular numbers : Stack « Collections Data Structure « Java

Related examples in the same category