Python Sorting Library
Project description
Python Sorting Library
Sorting algorithms
- Insert sort
- Bubble sort
- Merge sort
- Selection sort
- Quick sort
- Heap sort
- Counting sort
- Radix sort
Each sorting algorithm contains a precise implementation with documented time and space complexity.
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
Pre-commit
pre-commit clean
pre-commit install --hook-type pre-commit
pre-commit autoupdate
Coding standards
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.1.1.tar.gz
(4.1 kB
view hashes)
Built Distribution
Close
Hashes for pysortlib-0.1.1-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | a98b309fbe2d06ad84a93eabed40a357e79cdc9507ba59faed604c0d1fc1f99b |
|
MD5 | d0e469ef967dc8d7b90e019ee4c8515d |
|
BLAKE2b-256 | 5039a35d6558ccceffc46065ff49d2b265a223287dcf94df91149408035d7d9d |