Combination Template

Iterative:-

int nck[N][N];
void nCk(){
	for (int n = 0, nCk = 1; n < N; n++, nCk = 1)
		for (int k = 0; k <= n; k++)
			nck[n][k] = nCk, nCk = nCk * (n - k) / (k + 1);
}

Recursive:-

int nck(int n, int k) {
	return k > n ? 0 : (!k && n == k ? 1 : nck(n - 1, k - 1) + nck(n - 1, k));
}
Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: