[pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

Author: pre-commit-ci[bot]

sorts/adaptive_merge_sort.py

@@ -10,6 +10,7 @@
 python adaptive_merge_sort.py
 """
 
+
 def adaptive_merge_sort(collection: list) -> list:
     """
     Sorts a list using an adaptive merge sort algorithm.
@@ -32,13 +33,16 @@ def adaptive_merge_sort(collection: list) -> list:
     def find_run(collection: list, start: int) -> int:
         """
         Detects and returns the length of a naturally occurring run starting from 'start'.
-        
+
         :param collection: The list to detect runs in.
         :param start: The starting index for finding the run.
         :return: Length of the detected run.
         """
         run_length = 1
-        while start + run_length < len(collection) and collection[start + run_length - 1] <= collection[start + run_length]:
+        while (
+            start + run_length < len(collection)
+            and collection[start + run_length - 1] <= collection[start + run_length]
+        ):
             run_length += 1
         return run_length
 
@@ -65,7 +69,7 @@ def merge(left: list, right: list) -> list:
     # Step 1: Identify naturally occurring runs and store them in 'runs'
     while i < len(collection):
         run_length = find_run(collection, i)
-        runs.append(collection[i:i + run_length])
+        runs.append(collection[i : i + run_length])
         i += run_length
 
     # Step 2: Iteratively merge runs until one sorted collection remains
@@ -83,6 +87,7 @@ def merge(left: list, right: list) -> list:
 
 if __name__ == "__main__":
     import doctest
+
     doctest.testmod()
     try:
         user_input = input("Enter numbers separated by a comma:\n").strip()

sorts/stalin_merge_sort.py

@@ -1,6 +1,6 @@
 """
 This is a pure Python implementation of the Stalin Sort algorithm.
-Stalin Sort removes any elements that are out of ascending order, 
+Stalin Sort removes any elements that are out of ascending order,
 leaving only a sorted subsequence of the original list.
 
 For doctests run following command:
@@ -11,6 +11,7 @@
 python stalin_sort.py
 """
 
+
 def stalin_sort(collection: list) -> list:
     """
     Sorts a list by removing elements that are out of order, leaving a sorted subsequence.
@@ -40,6 +41,7 @@ def stalin_sort(collection: list) -> list:
 
 if __name__ == "__main__":
     import doctest
+
     doctest.testmod()
     try:
         user_input = input("Enter numbers separated by a comma:\n").strip()