binomial coefficients

public static int nonRecursive(int n, int k)
{
  int[] b = new int [n + 1];
        b [0] = 1;
        for (int i = 1; i <= n; ++i)
        {
            b  = 1;
            for (int j = i - 1; j > 0; --j)
                b [j] += b [j - 1];
        }
        return b [k];

 }