I found an algorithm that enumerates k-subsets of length n/4 for a input set of n length, having a time complexity $O{n\choose n/4}$, the algorithm fits well a problem I'm looking to solve, but I'd like to double check if I understood well its time complexity.
I plotted it for different increasing N and looks exponential (but not as bad as $2^n$ exponential)
As I don't want to do curve fitting... it is possible to simplify that expression in a way that makes possible to get a better sense of what will be its growth?
