From f046da9a8c83bfa368f58dba89f4e111e9366858 Mon Sep 17 00:00:00 2001
From: "pre-commit-ci[bot]"
 <66853113+pre-commit-ci[bot]@users.noreply.github.com>
Date: Wed, 16 Oct 2024 19:28:09 +0000
Subject: [PATCH] [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci
---
 sorts/adaptive_merge_sort.py | 6 ++++--
 1 file changed, 4 insertions(+), 2 deletions(-)

diff --git a/sorts/adaptive_merge_sort.py b/sorts/adaptive_merge_sort.py
index 07cb459e4..9cbee4b40 100644
--- a/sorts/adaptive_merge_sort.py
+++ b/sorts/adaptive_merge_sort.py
@@ -1,7 +1,7 @@
 def adaptive_merge_sort(sequence: list) -> list:
     """
     Sorts a list using the Adaptive Merge Sort algorithm.
-    
+
     >>> adaptive_merge_sort([4, 3, 1, 2])
     Initial sequence: [4, 3, 1, 2]
     Sorting: array[0:2] and array[2:4]
@@ -22,10 +22,11 @@ def adaptive_merge_sort(sequence: list) -> list:
     print(f"Sorted sequence: {sequence}")
     return sequence
 
+
 def adaptive_merge_sort_helper(array: list, aux: list, low: int, high: int) -> None:
     """
     Helper function for Adaptive Merge Sort algorithm.
-    
+
     >>> adaptive_merge_sort_helper([4, 3, 1, 2], [4, 3, 1, 2], 0, 3)
     Sorting: array[0:2] and array[2:4]
     Sorting: array[0:1] and array[1:2]
@@ -47,6 +48,7 @@ def adaptive_merge_sort_helper(array: list, aux: list, low: int, high: int) -> N
         return
     merge(array, aux, low, mid, high)
 
+
 def merge(array: list, aux: list, low: int, mid: int, high: int) -> None:
     """
     Merges two sorted subarrays of the main array.