Metadata-Version: 2.1
Name: matthewsort
Version: 0.1.10
Summary: An incredibly fast, multithreaded sorting algorithm implemented in Cython.
Home-page: https://github.com/Hylium/matthewsort-project
Author: Matthew
Author-email: matthew.hill@mail.utoronto.ca
Classifier: Programming Language :: Python :: 3
Classifier: License :: OSI Approved :: MIT License
Classifier: Operating System :: OS Independent
Classifier: Topic :: Scientific/Engineering
Classifier: Intended Audience :: Developers
Requires-Python: >=3.7
Description-Content-Type: text/markdown
License-File: LICENSE

# MatthewSort

An incredibly fast, multithreaded sorting algorithm implemented in Cython.

This library provides a high-performance sorting implementation that uses a parallelized bucket sort strategy and my own approximated index for fast speeds.

## Installation

Install `matthewsort` directly from PyPI:

```bash
pip install matthewsort
```

## Commands

Un-parallelized sort
```python
matthewsort.sort(<list>)
```
Parallelized sort
```python
matthewsort.supersort(<list>)
```

Both return a copy of the sorted list.

## Speed details

Time Complexity:
Best Case O(1)
Average Case: O(n)
Worst Case: O(n^2)
