nCk-complexity This is an exploration into finding a characterization of nCk's complexity that surpasses the ubiquitous and blunt $nCk = O\left(n^k\right)$.