mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-04 07:29:47 +08:00
86d333ee94
* chore: Switch to Node 20 + Vitest * chore: migrate to vitest mock functions * chore: code style (switch to prettier) * test: re-enable long-running test Seems the switch to Node 20 and Vitest has vastly improved the code's and / or the test's runtime! see #1193 * chore: code style * chore: fix failing tests * Updated Documentation in README.md * Update contribution guidelines to state usage of Prettier * fix: set prettier printWidth back to 80 * chore: apply updated code style automatically * fix: set prettier line endings to lf again * chore: apply updated code style automatically --------- Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Co-authored-by: Lars Müller <34514239+appgurueu@users.noreply.github.com>
32 lines
867 B
JavaScript
32 lines
867 B
JavaScript
/*
|
|
* Author: Akshay Dubey (https://github.com/itsAkshayDubey)
|
|
* Binomial Coefficient: https://en.wikipedia.org/wiki/Binomial_coefficient
|
|
* function to find binomial coefficient of numbers n and k.
|
|
* return binomial coefficient of n,k
|
|
*/
|
|
|
|
/**
|
|
* @function findBinomialCoefficient
|
|
* @description -> this function returns binomial coefficient
|
|
* of two numbers n & k given by n!/((n-k)!k!)
|
|
* @param {number} n
|
|
* @param {number} k
|
|
* @returns {number}
|
|
*/
|
|
|
|
import { calcFactorial } from './Factorial'
|
|
|
|
export const findBinomialCoefficient = (n, k) => {
|
|
if (typeof n !== 'number' || typeof k !== 'number') {
|
|
throw Error('Type of arguments must be number.')
|
|
}
|
|
if (n < 0 || k < 0) {
|
|
throw Error('Arguments must be greater than zero.')
|
|
}
|
|
let product = 1
|
|
for (let i = n; i > k; i--) {
|
|
product *= i
|
|
}
|
|
return product / calcFactorial(n - k)
|
|
}
|