binomial coefficient using dynamic programming

// JAVA Code for Dynamic Programming |  
// Set 9 (Binomial Coefficient) 
import java.util.*; 
  
class GFG { 
      
    static int binomialCoeff(int n, int k) 
    { 
        int C[] = new int[k + 1]; 
         
        // nC0 is 1 
        C[0] = 1;   
       
        for (int i = 1; i <= n; i++) 
        { 
            // Compute next row of pascal  
            // triangle using the previous row 
            for (int j = Math.min(i, k); j > 0; j--) 
                C[j] = C[j] + C[j-1]; 
        } 
        return C[k]; 
    } 
      
    /* Driver program  */
    public static void main(String[] args)  
    { 
         int n = 5, k = 2; 
            System.out.printf("Value of C(%d, %d) is %d "
                                , n, k, binomialCoeff(n, k)); 
    } 
} 

   C(n, k) = C(n-1, k-1) + C(n-1, k)
   C(n, 0) = C(n, n) = 1