Skip to content

Code samples for my blog post on enumerating binary strings without K-runs of ones.

Notifications You must be signed in to change notification settings

jtcho/EnumeratingBinaryStringsWithoutKRuns

Repository files navigation

Enumerating Binary Strings Without K-Runs of Ones

Implementations of the enumeration algorithm for counting numbers of N-long binary strings without K-runs of ones.

See my blog post for a detailed explanation of the algorithm and the intuition behind it. :)

About

Code samples for my blog post on enumerating binary strings without K-runs of ones.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published