Algorithm I designed to exploit the probabilistic nature of Skiplist datastructures to sort large data-sets with O(kn) time complexity
-
Updated
Sep 12, 2018 - Python
Algorithm I designed to exploit the probabilistic nature of Skiplist datastructures to sort large data-sets with O(kn) time complexity
BB Sort is a new stable number sorting algorithm. It is the mix of counting and bucket styles, that works using O(N) time even for non uniformly distributed numbers. Python3, C#, C++.
Add a description, image, and links to the non-comparison-sort topic page so that developers can more easily learn about it.
To associate your repository with the non-comparison-sort topic, visit your repo's landing page and select "manage topics."