Merge branch 'master' into master

Author: ImNotPranav

.github/workflows/build.yml

@@ -15,7 +15,7 @@ jobs:
         with:
           enable-cache: true
           cache-dependency-glob: uv.lock
-      - uses: actions/setup-python@v6
+      - uses: actions/setup-python@v7
         with:
           python-version: 3.14
           allow-prereleases: true

.github/workflows/directory_writer.yml

@@ -9,7 +9,7 @@ jobs:
       - uses: actions/checkout@v7
         with:
           fetch-depth: 0
-      - uses: actions/setup-python@v6
+      - uses: actions/setup-python@v7
         with:
           python-version: 3.14
           allow-prereleases: true

.github/workflows/project_euler.yml

@@ -23,7 +23,7 @@ jobs:
           libopenblas-dev
       - uses: actions/checkout@v7
       - uses: astral-sh/setup-uv@v7
-      - uses: actions/setup-python@v6
+      - uses: actions/setup-python@v7
         with:
           python-version: 3.14
           allow-prereleases: true
@@ -41,7 +41,7 @@ jobs:
           libopenblas-dev
       - uses: actions/checkout@v7
       - uses: astral-sh/setup-uv@v7
-      - uses: actions/setup-python@v6
+      - uses: actions/setup-python@v7
         with:
           python-version: 3.14
           allow-prereleases: true

.github/workflows/sphinx.yml

@@ -34,7 +34,7 @@ jobs:
           libopenblas-dev
       - uses: actions/checkout@v7
       - uses: astral-sh/setup-uv@v7
-      - uses: actions/setup-python@v6
+      - uses: actions/setup-python@v7
         with:
           python-version: 3.14
           allow-prereleases: true

.pre-commit-config.yaml

@@ -19,7 +19,7 @@ repos:
       - id: auto-walrus
 
   - repo: https://github.com/astral-sh/ruff-pre-commit
-    rev: v0.15.20
+    rev: v0.16.1
     hooks:
       - id: ruff-check
       - id: ruff-format

ciphers/a1z26.py

@@ -13,7 +13,21 @@ def encode(plain: str) -> list[int]:
     """
     >>> encode("myname")
     [13, 25, 14, 1, 13, 5]
+    >>> encode("abCd")
+    Traceback (most recent call last):
+        ...
+    ValueError: plain must contain only lowercase letters (a-z)
+    >>> encode("n0w")
+    Traceback (most recent call last):
+        ...
+    ValueError: plain must contain only lowercase letters (a-z)
+    >>> encode("later!")
+    Traceback (most recent call last):
+        ...
+    ValueError: plain must contain only lowercase letters (a-z)
     """
+    if not plain.islower() or not plain.isalpha():
+        raise ValueError("plain must contain only lowercase letters (a-z)")
     return [ord(elem) - 96 for elem in plain]
 
 

data_structures/binary_tree/inorder_tree_traversal_2022.py

@@ -43,7 +43,7 @@ def insert(node: BinaryTreeNode | None, new_value: int) -> BinaryTreeNode | None
     return node
 
 
-def inorder(node: None | BinaryTreeNode) -> list[int]:  # if node is None,return
+def inorder(node: BinaryTreeNode | None) -> list[int]:  # if node is None,return
     """
     >>> inorder(make_tree())
     [6, 10, 14, 15, 20, 25, 60]

machine_learning/sequential_minimum_optimization.py

@@ -451,7 +451,7 @@ def test_cancer_data():
     print("Hello!\nStart test SVM using the SMO algorithm!")
     # 0: download dataset and load into pandas' dataframe
     if not os.path.exists(r"cancer_data.csv"):
-        request = urllib.request.Request(  # noqa: S310
+        request = urllib.request.Request(
             CANCER_DATASET_URL,
             headers={"User-Agent": "Mozilla/4.0 (compatible; MSIE 5.5; Windows NT)"},
         )

sorts/bubble_sort.py

@@ -2,7 +2,18 @@
 
 
 def bubble_sort_iterative(collection: list[Any]) -> list[Any]:
-    """Pure implementation of bubble sort algorithm in Python
+    """Pure implementation of the bubble sort algorithm in Python (iterative).
+
+    Bubble sort works by repeatedly stepping through the collection,
+    comparing each pair of adjacent elements and swapping them if they
+    are in the wrong order. This process repeats, with each full pass
+    "bubbling" the next-largest unsorted element into its correct
+    position at the end of the collection, until a full pass completes
+    with no swaps, at which point the collection is sorted.
+
+    Time complexity: O(n) best case (already sorted, thanks to the
+    early-exit optimization), O(n^2) average and worst case.
+    Space complexity: O(1) auxiliary (sorts in place).
 
     :param collection: some mutable ordered collection with heterogeneous
     comparable items inside
@@ -61,7 +72,19 @@ def bubble_sort_iterative(collection: list[Any]) -> list[Any]:
 
 
 def bubble_sort_recursive(collection: list[Any]) -> list[Any]:
-    """It is similar iterative bubble sort but recursive.
+    """Pure implementation of the bubble sort algorithm in Python (recursive).
+
+    Functionally identical to the iterative version: each call makes a
+    single pass through the collection, comparing adjacent elements and
+    swapping any pair that is out of order. If any swap occurred during
+    the pass, the function calls itself again on the (partially sorted)
+    collection; once a pass completes with no swaps, the collection is
+    sorted and the recursion stops.
+
+    Time complexity: O(n) best case (already sorted), O(n^2) average and
+    worst case.
+    Space complexity: O(1) auxiliary for the sort itself (sorts in place),
+    though the recursion adds O(n) call-stack frames in the worst case.
 
     :param collection: mutable ordered sequence of elements
     :return: the same list in ascending order

web_programming/download_images_from_google_query.py

@@ -88,8 +88,11 @@ def download_images_from_google_query(query: str = "dhaka", max_images: int = 5)
         opener.addheaders = [
             (
                 "User-Agent",
-                "Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36"
-                " (KHTML, like Gecko) Chrome/70.0.3538.102 Safari/537.36 Edge/18.19582",
+                (
+                    "Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36"
+                    " (KHTML, like Gecko) Chrome/70.0.3538.102 Safari/537.36"
+                    " Edge/18.19582"
+                ),
             )
         ]
         urllib.request.install_opener(opener)