Merge b6fd43f29e6ba4516fe9222581f91090f8967ecb into e59d819d091efdb30e385f4ecfe9ab5d36c3be71

updates:
- [github.com/astral-sh/ruff-pre-commit: v0.9.3 → v0.9.4](https://github.com/astral-sh/ruff-pre-commit/compare/v0.9.3...v0.9.4)
- [github.com/codespell-project/codespell: v2.4.0 → v2.4.1](https://github.com/codespell-project/codespell/compare/v2.4.0...v2.4.1)

Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>

.pre-commit-config.yaml

@@ -16,13 +16,13 @@ repos:
       - id: auto-walrus
 
   - repo: https://github.com/astral-sh/ruff-pre-commit
-    rev: v0.9.3
+    rev: v0.9.4
     hooks:
       - id: ruff
       - id: ruff-format
 
   - repo: https://github.com/codespell-project/codespell
-    rev: v2.4.0
+    rev: v2.4.1
     hooks:
       - id: codespell
         additional_dependencies:

sorts/quantum_bogo_sort.py

@@ -0,0 +1,34 @@
+def quantum_bogo_sort(arr: list[int]) -> list[int]:
+    """
+    Quantum Bogo Sort is a theoretical sorting algorithm that uses quantum
+    mechanics to sort the elements. It is not practically feasible and is
+    included here for humor.
+
+    More info:
+    https://en.wikipedia.org/wiki/Bogosort#:~:text=achieve%20massive%20complexity.-,Quantum%20bogosort,-A%20hypothetical%20sorting
+
+    :param arr: list[int] - The list of numbers to sort.
+    :return: list[int] - The sorted list, humorously assumed to be
+    instantly sorted using quantum superposition.
+
+    Example:
+    >>> quantum_bogo_sort([2, 1, 4, 3])
+    [1, 2, 3, 4]
+
+    >>> quantum_bogo_sort([10, -1, 0])
+    [-1, 0, 10]
+
+    >>> quantum_bogo_sort([5])
+    [5]
+
+    >>> quantum_bogo_sort([])
+    []
+    """
+    return sorted(
+        arr
+    )  # Sorting is assumed to be done instantly via quantum superposition
+
+
+if __name__ == "__main__":
+    my_array: list[int] = [2, 1, 4, 3]
+    print(quantum_bogo_sort(my_array))