Sort Integers using different sorting algorithms!

Check the releases section to find the latest working zip/tar.

python -m py_sorter -g 8 -s bogo -l -c

Output:

Shuffles: 63,257
Algorithm: [bogo]
Original List:
468, 846, 801, 976, 261, 641, 72, 698
Sorted List:
72, 261, 468, 641, 698, 801, 846, 976
Time(seconds) bogo: 0.3453168464965863
Time(seconds) sorted(): 3.5189852184980275e-06
bogo was 0.3453133275113678 seconds slower.

python -m py_sorter --generate 10000 --sort quick

Output:

Algorithm: [quick]
Time(seconds): 0.02490532463518387

• Be careful when using the Bogo sorting algorithm, it shuffles an array and checks it's been sorted, shuffling infinitely until list is sorted. larger data sets will take a long time (forever).

• Some algorithms use recursive sub routines to sort, this can lead to RecursionErrors if the data set is very large.

• Clone repository locally.
• python setup.py install.
• Access module from console with python -m py_sorter [args].

• While developing, inside root (/py_sorter) you can test new code changes with:
  • python sorter-runner.py [args]

• New tests can be added to the run_all.py file located at (/tests).

• To run automated tests:

  • python -m run_all

• becurrie
• garroadran - Heap, Insertion, Recursive Insertion algorithms.
• underhood31 - Shell algorithm.

See also the list of contributors who participated in this project.

This project is licensed under the MIT License - see the LICENSE file for details

• Interactive Python
• GeeksforGeeks

• argparse