Merge branch 'TheAlgorithms:master' into master

Author: las-r

.github/workflows/sphinx.yml

@@ -41,7 +41,7 @@ jobs:
       - run: uv sync --group=docs
       - uses: actions/configure-pages@v6
       - run: uv run sphinx-build -c docs . docs/_build/html
-      - uses: actions/upload-pages-artifact@v4
+      - uses: actions/upload-pages-artifact@v5
         with:
           path: docs/_build/html
 

.pre-commit-config.yaml

@@ -19,20 +19,20 @@ repos:
       - id: auto-walrus
 
   - repo: https://github.com/astral-sh/ruff-pre-commit
-    rev: v0.15.4
+    rev: v0.15.9
     hooks:
       - id: ruff-check
       - id: ruff-format
 
   - repo: https://github.com/codespell-project/codespell
-    rev: v2.4.1
+    rev: v2.4.2
     hooks:
       - id: codespell
         additional_dependencies:
           - tomli
 
   - repo: https://github.com/tox-dev/pyproject-fmt
-    rev: v2.16.2
+    rev: v2.21.0
     hooks:
       - id: pyproject-fmt
 

hashes/hamming_code.py

@@ -118,7 +118,6 @@ def emitter_converter(size_par, data):
             data_ord.append(None)
 
     # Calculates parity
-    qtd_bp = 0  # parity bit counter
     for bp in range(1, size_par + 1):
         # Bit counter one for a given parity
         cont_bo = 0
@@ -133,8 +132,6 @@ def emitter_converter(size_par, data):
                     cont_bo += 1
         parity.append(cont_bo % 2)
 
-        qtd_bp += 1
-
     # Mount the message
     cont_bp = 0  # parity bit counter
     for x in range(size_par + len(data)):
@@ -208,7 +205,6 @@ def receptor_converter(size_par, data):
             data_ord.append(None)
 
     # Calculates parity
-    qtd_bp = 0  # parity bit counter
     for bp in range(1, size_par + 1):
         # Bit counter one for a certain parity
         cont_bo = 0
@@ -222,8 +218,6 @@ def receptor_converter(size_par, data):
                     cont_bo += 1
         parity.append(str(cont_bo % 2))
 
-        qtd_bp += 1
-
     # Mount the message
     cont_bp = 0  # Parity bit counter
     for x in range(size_par + len(data_output)):

pyproject.toml

@@ -165,6 +165,9 @@ skip = """\
   nary.txt,strings/words.txt\
   """
 
+[tool.mypy]
+python_version = "3.14"
+
 [tool.pytest]
 ini_options.markers = [
   "mat_ops: mark a test as utilizing matrix operations.",
@@ -182,9 +185,6 @@ report.omit = [
 ]
 report.sort = "Cover"
 
-[tool.mypy]
-python_version = "3.14"
-
 [tool.sphinx-pyproject]
 copyright = "2014, TheAlgorithms"
 autoapi_dirs = [

sorts/pigeonhole_sort.py

@@ -10,7 +10,11 @@ def pigeonhole_sort(a):
     >>> pigeonhole_sort(a)  # a destructive sort
     >>> a == b
     True
+
+    >>> pigeonhole_sort([])
     """
+    if not a:
+        return
     # size of range of values in the list (ie, number of pigeonholes we need)
 
     min_val = min(a)  # min() finds the minimum value
@@ -38,7 +42,7 @@ def pigeonhole_sort(a):
 def main():
     a = [8, 3, 2, 7, 4, 6, 8]
     pigeonhole_sort(a)
-    print("Sorted order is:", " ".join(a))
+    print("Sorted order is:", *a)
 
 
 if __name__ == "__main__":

sorts/unknown_sort.py

@@ -6,7 +6,7 @@
 """
 
 
-def merge_sort(collection):
+def merge_sort(collection: list) -> list:
     """Pure implementation of the fastest merge sort algorithm in Python
 
     :param collection: some mutable ordered collection with heterogeneous