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.1 (2023-04-7): More history, ChainAndY
Add Sort.history_comparisons_values_: history of the pairwise comparisons, in terms of compared values (whereas history_comparisons_ gives the original indices). Similarly, add WrapSortScorer.history_comparisons_values_ and WrapFullJit.history_comparisons_values_.
Add CorSort.history_leq_: history of the matrix leq_ representing the current poset. This is recorded if the newly added parameter record_leq is True.
Add WrapFullJit.history_states_: history of the state of the list.
Add ChainAndY: poset consisting of a chain and a Y-shape.
Add print_corsort_execution: generate LaTeX code for a CorSort execution.
partition is now stable (in the sense of “stable” sorting), hence also SortQuick, SortAsortQuickselect, and SortLargestInterval.
0.1.0 (2023-02-16): First release
Corsort (regular Python or with numba acceleration).
Classical sorting algorithms: Asort (with quickselect for median selection), 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.1-py2.py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | c009eb36c4ef2874735487485ac77ccb0d6066cb472310ba7e6ef1a4f5670cbd |
|
MD5 | 08d97fb257972679129fa5e610430b6c |
|
BLAKE2b-256 | 01ccdda49b5e7c4f5f90b434e168ef5679c885ab3437789552111c56cd2c8845 |