```python
def binomial_Coeff(n, k):
    """
    Calculates the binomial coefficient C(n, k).
    
    The formula used is C(n, k) = n! / (k! * (n-k)!).
    This implementation uses a more efficient multiplicative formula:
    C(n, k) = (n * (n-1) * ... * (n-k+1)) / k!
    It also uses the symmetry property C(n, k) = C(n, n-k).
    """
    # Handle edge cases where the coefficient is 0
    if k < 0 or k > n:
        return 0
    
    # Use the symmetry property C(n, k) = C(n, n-k) to minimize calculations
    if k > n - k:
        k = n - k
        
    # C(n, 0) = 1
    if k == 0:
        return 1
        
    res = 1
    # Calculate the value of [n * (n-1) * ... * (n-k+1)] / [k * (k-1) * ... * 1]
    for i in range(k):
        res = res * (n - i) // (i + 1)
        
    return res
```