IterativePascal

import java.util.Scanner;

public class IterativePascal extends ErrorPascal implements Pascal {

    public void printPascal(int n) {

        termsPascal(n);

        //right-side up
        if(b == true){

        //prints out elements in each level of triangle starting from level 0
        for (int i = 0; i <= n; i++) {

            for (int j = 0; j <= i; j++) {
                System.out.print(binom(i, j) + " ");
            }
            System.out.println();
        }
    }

        //upside-down
        if (b == false){

        //prints out elements in each level of triangle starting from level n
        for (int j = n; j >= 0; j--) {

            for (int i = 0; i <= j; i++) {
                System.out.print(binom(j, i));
        }
        System.out.println();
        }
    }
    }

    public int binom(int n, int k) {

        termsBinom(n, k);

        double x = 1;
        double y = 1;
        double z = n - k;
        double w = 1;

        //n!
        for (int i = 1; i <= n; i++) {
            x = x * i;
        }
        //k!
        for (int i = 1; i <= k; i++) {

            y = y * i;
        }
        //(n-k)!
        for (int i = 1; i <= z; i++) {

            w = w * i;
        }
        return (int) (x/(y*w));


    }



}