|
|
Pascal Triangle1
| |
package com.bethecoder.tutorials.core.triangle;
public class PascalTriangle {
/**
* @param args
*/
public static void main(String[] args) {
printPascalTriangle(10);
}
public static void printPascalTriangle(int num) {
for (int i = 0 ; i < num ; i ++ ) {
for (int j = 0 ; j <= i ; j ++) {
System.out.print(nCr(i, j) + " ");
}
System.out.println();
}
}
public static int nCr(int n, int r) {
return fact(n)/(fact(r) * fact(n-r));
}
public static int fact(int n) {
if (n <= 1) {
return 1;
} else {
return n * fact(n-1);
}
}
}
|
| | |
It gives the following output,
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1
1 6 15 20 15 6 1
1 7 21 35 35 21 7 1
1 8 28 56 70 56 28 8 1
1 9 36 84 126 126 84 36 9 1
|
|
