Python Sorting Library
Project description
Python Sorting Library
Sorting algorithms with precise implementation and documentation.
Implemented:
- Insert sort
- Bubble sort
- Merge sort
- Selection sort
- Quick sort
- Heap sort
- Shell sort
- Counting sort
- Radix sort
Planned:
- Cycle sort
- Pancake 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.2.0.tar.gz
(4.7 kB
view hashes)
Built Distribution
Close
Hashes for pysortlib-0.2.0-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 53675da78ce5ed56574b3931e4c32e431ec0010de8a38ef8c6de04e67d8d77b1 |
|
MD5 | daf056c5122b1b47d3a7c17d9830c0fa |
|
BLAKE2b-256 | 986b6a2c3c09cff0c71f05c24d8c6e2283f3e3cec0848e362665cb560b8fa851 |