Implementing different papers for proving minimum size of a sorting network for a given N. The goal is readability to help onboarding.
Proof based algorithm for finding optimal depth for sorting network
License
andersfylling/go-sortnet
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
About
Proof based algorithm for finding optimal depth for sorting network
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published