# Sorting-Algorithms-Blender ## Bubble Sort ![bubble](https://user-images.githubusercontent.com/78089013/167689895-ba7e3ddd-6ea9-41e0-8767-0700b12b6664.gif) ## Insertion Sort ![Inerstio](https://user-images.githubusercontent.com/78089013/170041841-1c114899-1ada-4278-9865-6939774f373f.gif) ## Selection Sort ![SelectionSort](https://user-images.githubusercontent.com/78089013/171057662-f1bc5c22-5dcf-4242-ab0f-fe5a08bf4e1a.gif) ## Big O
Algorithm Time Complexity Space Complexity
Best Case Average Case Worst Case Worst Case
Quicksort Ω(n log(n))
 Θ(n log(n))
 O(n^2)
 O(log(n))
Mergesort Ω(n log(n))
 Θ(n log(n))
 O(n log(n))
 O(n)
Timsort Ω(n)
 Θ(n log(n))
 O(n log(n))
 O(n)
Heapsort Ω(n log(n))
 Θ(n log(n))
 O(n log(n))
 O(1)
Bubble Sort Ω(n)
 Θ(n^2)
 O(n^2)
 O(1)
Insertion Sort Ω(n)
 Θ(n^2)
 O(n^2)
 O(1)
Selection Sort Ω(n^2)
 Θ(n^2)
 O(n^2)
 O(1)
Tree Sort Ω(n log(n))
 Θ(n log(n))
 O(n^2)
 O(n)
Shell Sort Ω(n log(n))
 Θ(n(log(n))^2)
 O(n(log(n))^2)
 O(1)
Bucket Sort Ω(n+k)
 Θ(n+k)
 O(n^2)
 O(n)
Radix Sort Ω(nk)
 Θ(nk)
 O(nk)
 O(n+k)
Counting Sort Ω(n+k)
 Θ(n+k)
 O(n+k)
 O(k)
Cubesort Ω(n)
 Θ(n log(n))
 O(n log(n))
 O(n)