Add doctests for adaptive_merge_sort

Removed print statements for initial sequence, sorted sequence, sorting steps, and after merge.

Author: FerbiyaP

sorts/adaptive_merge_sort.py

@@ -6,13 +6,22 @@ def __lt__(self, other: object, /) -> bool: ...
 
 
 def adaptive_merge_sort[T: Comparable](sequence: list[T]) -> list[T]:
+    """
+    Sort a sequence using adaptive merge sort.
+
+    >>> adaptive_merge_sort([4, 3, 1, 2])
+    [1, 2, 3, 4]
+    >>> adaptive_merge_sort(["banana", "apple", "cherry"])
+    ["apple", "banana", "cherry"]
+    >>> adaptive_merge_sort([1, "apple"])
+    Traceback (most recent call last):
+    TypeError: '<' not supported between instances of 'str' and 'int'
+    """
     if len(sequence) < 2:
         return sequence
 
     aux = sequence[:]
-    print(f"Initial sequence: {sequence}")
     adaptive_merge_sort_helper(sequence, aux, 0, len(sequence) - 1)
-    print(f"Sorted sequence: {sequence}")
     return sequence
 
 
@@ -23,13 +32,11 @@ def adaptive_merge_sort_helper[T: Comparable](
         return
 
     mid = (low + high) // 2
-    print(f"Sorting: array[{low}:{mid + 1}] and array[{mid + 1}:{high + 1}]")
 
     adaptive_merge_sort_helper(aux, array, low, mid)
     adaptive_merge_sort_helper(aux, array, mid + 1, high)
 
     if not array[mid + 1] < array[mid]:
-        print(f"Skipping merge as array[{mid}] <= array[{mid + 1}]")
         array[low : high + 1] = aux[low : high + 1]
         return
 
@@ -39,9 +46,8 @@ def adaptive_merge_sort_helper[T: Comparable](
 def merge[T: Comparable](
     array: list[T], aux: list[T], low: int, mid: int, high: int
 ) -> None:
-    print(f"Merging: array[{low}:{mid + 1}] and array[{mid + 1}:{high + 1}]")
-
     i, j = low, mid + 1
+
     for k in range(low, high + 1):
         if i > mid or j > high:
             if i > mid:
@@ -59,13 +65,3 @@ def merge[T: Comparable](
 
     for k in range(low, high + 1):
         array[k] = aux[k]
-
-    print(f"After merge: {array[low : high + 1]}")
-
-
-# Example usage
-if __name__ == "__main__":
-    print(adaptive_merge_sort([4, 3, 1, 2]))
-# Example usage
-if __name__ == "__main__":
-    print(adaptive_merge_sort([4, 3, 1, 2]))