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

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

Author: pre-commit-ci[bot]

sorts/power_sort.py

@@ -67,11 +67,9 @@ def _find_run(
     if start >= end - 1:
         return start + 1
 
-
     key_func = key if key else lambda x: x
     run_end = start + 1
 
-
     # Check if run is ascending or descending
     if key_func(arr[run_end]) < key_func(arr[start]):
         # Descending run
@@ -84,7 +82,6 @@ def _find_run(
         while run_end < end and key_func(arr[run_end]) >= key_func(arr[run_end - 1]):
             run_end += 1
 
-
     return run_end
 
 
@@ -133,7 +130,6 @@ def _node_power(n: int, b1: int, n1: int, b2: int, n2: int) -> int:
     while (a * (1 << power)) // two_n == (b * (1 << power)) // two_n:
         power += 1
 
-
     return power
 
 
@@ -170,16 +166,13 @@ def _merge(
     """
     key_func = key if key else lambda x: x
 
-
     # Copy the runs to temporary storage
     left = arr[start1:end1]
     right = arr[end1:end2]
 
-
     i = j = 0
     k = start1
 
-
     # Merge the two runs
     while i < len(left) and j < len(right):
         if key_func(left[i]) <= key_func(right[j]):
@@ -190,14 +183,12 @@ def _merge(
             j += 1
         k += 1
 
-
     # Copy remaining elements
     while i < len(left):
         arr[k] = left[i]
         i += 1
         k += 1
 
-
     while j < len(right):
         arr[k] = right[j]
         j += 1
@@ -269,12 +260,10 @@ def power_sort(
     if len(collection) <= 1:
         return collection
 
-
     # Make a copy to avoid modifying the original if it's immutable
     arr = list(collection)
     n = len(arr)
 
-
     # Adjust key function for reverse sorting
     needs_final_reverse = False
     if reverse:
@@ -287,7 +276,6 @@ def reverse_key(x):
                     return -val
                 return val
 
-
             key = reverse_key
             needs_final_reverse = True
         else:
@@ -303,34 +291,29 @@ def reverse_cmp(x):
     # Stack to hold runs: each entry is (start_index, length, power)
     stack: list[tuple[int, int, int]] = []
 
-
     start = 0
     while start < n:
         # Find the next run
         run_end = _find_run(arr, start, n, key)
         run_length = run_end - start
 
-
         # Calculate power for this run
         if len(stack) == 0:
             power = 0
         else:
             prev_start, prev_length, _ = stack[-1]
             power = _node_power(n, prev_start, prev_length, start, run_length)
 
-
         # Merge runs from stack based on power comparison
         while len(stack) > 0 and stack[-1][2] >= power:
             # Merge the top run with the current run
             prev_start, prev_length, _ = stack.pop()
             _merge(arr, prev_start, prev_start + prev_length, run_end, key)
 
-
             # Update current run to include the merged run
             start = prev_start
             run_length = run_end - start
 
-
             # Recalculate power
             if len(stack) == 0:
                 power = 0
@@ -340,19 +323,16 @@ def reverse_cmp(x):
                     n, prev_prev_start, prev_prev_length, start, run_length
                 )
 
-
         # Push current run onto stack
         stack.append((start, run_length, power))
         start = run_end
 
-
     # Merge all remaining runs on the stack
     while len(stack) > 1:
         start2, length2, _ = stack.pop()
         start1, length1, _ = stack.pop()
         _merge(arr, start1, start1 + length1, start2 + length2, key)
 
-
         # Recalculate power for merged run
         if len(stack) == 0:
             power = 0
@@ -363,7 +343,6 @@ def reverse_cmp(x):
 
         stack.append((start1, start2 + length2 - start1, power))
 
-
     # Handle reverse sorting for non-numeric types
     if (
         reverse
@@ -382,34 +361,27 @@ def reverse_cmp(x):
 if __name__ == "__main__":
     import doctest
 
-
     doctest.testmod()
 
-
     print("\nPowerSort Interactive Testing")
     print("=" * 40)
 
-
     try:
         user_input = input("Enter numbers separated by a comma:\n").strip()
         if user_input == "":
             unsorted = []
         else:
             unsorted = [int(item.strip()) for item in user_input.split(",")]
 
-
         print(f"\nOriginal: {unsorted}")
         sorted_list = power_sort(unsorted)
         print(f"Sorted:   {sorted_list}")
 
-
         # Test reverse
         sorted_reverse = power_sort(unsorted, reverse=True)
         print(f"Reverse:  {sorted_reverse}")
 
-
     except ValueError:
         print("Invalid input. Please enter valid integers separated by commas.")
     except KeyboardInterrupt:
         print("\n\nGoodbye!")
-