Comparison-Oriented Sort.
Project description
Corsort
Comparison-Oriented Sort.
Free software: GNU General Public License v3
Documentation: https://emczg.github.io/corsort/.
Features
Implement Corsort, an efficient anytime sorting algorithm.
Compare Corsort with classical algorithms through Monte-Carlo simulations.
Credits
This package was created with Cookiecutter and the francois-durand/package_helper_2 project template.
History
0.1.0 (2023-02-16): First release
Corsort (regular Python or with numba acceleration).
Classical sorting algorithms: Asort (with quickselect for median seletion), Ford-Johnson, quicksort, quicksort with priority on the largest interval, merge sort (DFS or BFS).
Entropy bound.
Monte-Carlo simulations.
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Hashes for corsort-0.1.0-py2.py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 8ab8e87f7e2941cec36602e77225f3a1d0ac07c5c15acaa6920129818be9bfcb |
|
MD5 | d8b26bcfbbba24092d78c95ad07bdcaf |
|
BLAKE2b-256 | ba9be67f1d148463753c0885932fd7fd69f10f9e34fc860ada8ed5677678a911 |