GFG ENTRINGER NUMBER (RECURSIVE)

#include <bits/stdc++.h>

using namespace std;

int zigzag(int n, int k) {

	if (n == 0 && k == 0)
		return 1;

	if (k == 0)
		return 0;

	return zigzag(n, k - 1) +	zigzag(n - 1, n - k);
}

int main() {
	int n = 4, k = 3;
	cout << zigzag(n, k) << endl;
	return 0;
}