Apply multiple type of sorting algorithm on your data and also compare which sorting is fastes on your data
Project description
python-sorter
A Python package to apply multiple type of sorting algorithm on your data and also compare which sorting is fastes on your data
Features
1. Brick_Sort
2. Bubble_Sort
3. Bucket_Sort
4. Comb_Sort
5. Counting_Sort
6. Cycle_Sort
7. Gnome_Sort
8. Heap_Sort
9. Insertion_Sort
10. Intro_Sort
11. Merge_Sort
12. Pigeonhole_Sort
13. Quick_Sort
14. Radix_Sort
15. Selection_Sort
16. Stooge_Sort
17. Strand_Sort
18. Tree_Sort
Available total 18 sorting algorithm to perform sorting.
Prerequisites
- Python 3 and pip or Anaconda
- Active Internet Connection
Getting started
Clone the repository to your local machine using,
~$ git clone https://github.com/Deep-Dey/Time-Calculation-for-Sorting-Algorithms.git
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
python-sorter-1.0.1.tar.gz
(10.9 kB
view details)
File details
Details for the file python-sorter-1.0.1.tar.gz.
File metadata
- Download URL: python-sorter-1.0.1.tar.gz
- Upload date:
- Size: 10.9 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/4.0.0 CPython/3.8.6
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 2a5c002b968a938f8888de45f824be53bd413addfa04a733bbe3118dcbe89461 |
|
| MD5 | 2a7b3ef07738e7cd5715c6bd3256c6c6 |
|
| BLAKE2b-256 | acc9c4c67855bbe295001efcd0f8717d84300e149367ad2c248f0386c45d48e8 |
