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.5.tar.gz
(11.0 kB
view hashes)
