Algorithm Complexity
====================

.. list-table::
   :header-rows: 1

   * - Algorithm
     - Best Case
     - Average Case
     - Worst Case
     - Space Complexity
   * - Bubble Sort
     - O(n)
     - O(n²)
     - O(n²)
     - O(1)
   * - Insertion Sort
     - O(n)
     - O(n²)
     - O(n²)
     - O(1)
   * - Selection Sort
     - O(n²)
     - O(n²)
     - O(n²)
     - O(1)
   * - Quick Sort
     - O(n log n)
     - O(n log n)
     - O(n²)
     - O(log n)
   * - Merge Sort
     - O(n log n)
     - O(n log n)
     - O(n log n)
     - O(n)
   * - Heap Sort
     - O(n log n)
     - O(n log n)
     - O(n log n)
     - O(1)
   * - Counting Sort
     - O(n+k)
     - O(n+k)
     - O(n+k)
     - O(n+k)
   * - Shell Sort
     - O(n log n)
     - O(n(log n)²)
     - O(n(log n)²)
     - O(1)
   * - Radix Sort
     - O(nk)
     - O(nk)
     - O(nk)
     - O(n+k)