Sorting Algorithms Implementation
This repository contains implementation of different sorting algorithms in Python.
Overview
Note! In order to test the code with large amount of data, I used random.sample to generate these lists. You can basically remove those lines if you don't want them.
The implemented algorithms include:
- Quicksort using the first element as the pivot
- Quicksort using median of three as the pivot
- d-Heapsort
- Merge Sort with insertion sort as a hybrid sort for small subarrays
Contributing
Contributions to this project are welcome. If you find a bug or want to suggest an improvement, please open an issue or submit a pull request. Or email me here: f.asadi2002@gmail.com
License
This code is released under the MIT License.