Time Complexity

The figures are arranged for the Best Case, the Worst Case, and the Average Case.

➀ Bubble Sort ➠ O(n), O(n²), O(n²)

➁ Selection Sort ➠ O(n²), O(n²), O(n²)

➂ Insertion Sort ➠ O(n), O(n²), O(n²)

➃ Merge Sort ➠ O(n*logn), O(n*logn), O(n*logn)

➄ Quick Sort ➠ O(n*logn), O(n²), O(n*logn)

➅ Counting Sort ➠ O(n+k), O(n+k), O(n+k)

➆ Radix Sort ➠ O(n+k), O(n+k), O(n+k)

➇ Bucket Sort ➠ O(n+k), O(n²), O(n)

➈ Heap Sort ➠ O(n*logn), O(n*logn), O(n*logn)

➉ Shell Sort ➠ O(n*logn), O(n²), O(n*logn)

Source: x.com/swapnakpanda/status/1859818640113271294