- Bubble Sort
- Insertion Sort
- Merge Sort
- Quick Sort
- Selection Sort
All the sorting algorithms run in parallel, and are given the same set of 1000 random numbers. As soon as each algorithm completes execution, it reports the execution time in seconds.
ankushsawant/sorting_algorithms
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Simple Sorting Algorithms in Python
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published