Skip to content
/ nCk-complexity Public

This is an exploration to find a truer characterization of nCk's asymptotic behavior than the ubiquitous and blunt nCk = O(n^k).

0 stars 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

CrepeGoat/nCk-complexity

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
README.md
README.md
 
 
nck_approx_plots.ipynb
nck_approx_plots.ipynb
 
 

Repository files navigation

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)$.

About

This is an exploration to find a truer characterization of nCk's asymptotic behavior than the ubiquitous and blunt nCk = O(n^k).

Resources

Readme
Activity

Stars

0 stars

Watchers

2 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages