Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/azanul/sorting-visualized
Graphical representation of all the sorting algorithms.
https://github.com/azanul/sorting-visualized
sorting sorting-algorithms
Last synced: about 8 hours ago
JSON representation
Graphical representation of all the sorting algorithms.
- Host: GitHub
- URL: https://github.com/azanul/sorting-visualized
- Owner: Azanul
- License: mit
- Created: 2019-12-22T16:07:59.000Z (almost 5 years ago)
- Default Branch: master
- Last Pushed: 2022-11-06T09:24:16.000Z (about 2 years ago)
- Last Synced: 2023-03-04T21:42:37.932Z (over 1 year ago)
- Topics: sorting, sorting-algorithms
- Language: Python
- Homepage:
- Size: 41 KB
- Stars: 9
- Watchers: 2
- Forks: 5
- Open Issues: 9
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Sorting-Visualized
Graphical representation of all the following sorting algorithms-|Sn.| Name | Worst Case complexity | Best-case complexity | Average-case complexity|
----|---------------|-----------------------------|---------------------------|---------------------------|
|1. | Insertion | O(n^2) | Ω(n) | θ(n^2) |
|2. | Selection | O(n^2) | Ω(n^2) | θ(n^2) |
|3. | Heap | O(n log(n)) | Ω(n log(n)) | θ(n log(n)) |
|4. | Quick | O(n^2) | Ω(n log(n)) | θ(n log(n)) |
|5. | Merge | O(n log(n)) | Ω(n log(n)) | θ(n log(n)) |
|6. | Radix | O(nk) | Ω(nk) | θ(nk) |
|7. | Bubble | O(n^2) | Ω(n) | θ(n^2) |
|8. | Cocktail | O(n^2) | Ω(n) | θ(n^2) |