Python Sorting Library
Project description
Python Sorting Library
Sorting algorithms with precise implementation and documentation.
Implemented:
- Bubble sort
- Counting sort
- Heap sort
- Insert sort
- Merge sort
- Pancake sort
- Quick sort
- Radix sort
- Selection sort
- Shell sort
- Sleep sort
Planned:
- Cycle sort
Install
pip install pysortlib
Usage
from pysortlib import insert_sort
array = [3, 5, 2, 1, 7, 4, 6]
insert_sort(array) # set a breakpoint and explore \o/
print(array)
Development
Virtual environment
pip install --user poetry
poetry config virtualenvs.in-project true
poety shell
poetry install
Dependencies
poetry update
Pre-commit
pre-commit clean
pre-commit install --hook-type pre-commit
Coding standards
perfectionism- black - code formatting
- ruff - static code analysis
- mypy - static type checking
- pytest - unit tests
License
This project is licensed under the terms of the MIT license.
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
pysortlib-0.4.0.tar.gz
(5.0 kB
view hashes)
Built Distribution
Close
Hashes for pysortlib-0.4.0-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | c87895912de8a636a9aa0c276afa95e32f39f9ee424bb790c759b81ecd0c1953 |
|
MD5 | c05919ca083c9bfafcd435aea3b31fdd |
|
BLAKE2b-256 | a8661742da7070fbf645e6c8f89322e60f8a5ef54fba0fee4931fbb9e3f5fe77 |