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
Planned:
- Cycle sort
- Sleep 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.3.0.tar.gz
(4.8 kB
view hashes)
Built Distribution
Close
Hashes for pysortlib-0.3.0-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 936be68b93c99984e3022c3e93213ef70227bc0161b3a71f0e4a5ef786971d06 |
|
MD5 | 56a3a10f6804e968fc6b0779cfa35e84 |
|
BLAKE2b-256 | 2dd591376ed0c4711c630b2c363686db460238b50e11cd3145ccca0ce70b7712 |