Pages

Monday, March 31, 2025

Binomial Coefficient (Factorial) in Functions in C++

 


int factorial(int n) {
    int fact = 1;
    for(int i =1; i<=n; i++){
        fact *= i;

    }
    return fact;
}

int binCoeff(int n, int r) {
    int val1 = factorial(n);
    int val2 = factorial(r);
    int val3 = factorial(n-r);

    int result = val1/(val2*val3);
    return result;
}

int main(){

    cout << binCoeff(4, 2) << endl;
   

    return 0;
}

No comments:

Post a Comment

3917. Count Indices With Opposite Parity (Brute Force) O(n2) + Optimized Solution O(n) + tips LEETCODE WEEKLY 500

  class Solution {     public int [] countOppositeParity ( int [] nums ) {          // approach 1 - checks every pair         int n = n...