Fix line length issues in docstrings

Author: asraym

sorts/bubble_sort.py

@@ -3,13 +3,15 @@
 
 def bubble_sort_iterative(collection: list[Any]) -> list[Any]:
     """Pure implementation of bubble sort algorithm in Python.
-    Bubble sort repeatedly steps through the list, compares adjacent elements, and swaps them
-    if they are in the wrong order. This process is repeated until the list is sorted.
-
-    Time COmplexity:
+    Bubble sort repeatedly steps through the list, compares adjacent 
+    elements, and swaps them if they are in the wrong order. 
+    This process is repeated until the list is sorted. 
+    
+    Time Complexity:
         Worst Case: O(n^2)
         Average Case: O(n^2)
-        Best Case: O(n) (When the list is already sorted and optimized with early stopping)
+        Best Case: O(n) (When the list is already sorted and 
+        optimized with early stopping)
 
     Space Complexity:
         O(1) (in-place sorting)
@@ -75,7 +77,8 @@ def bubble_sort_recursive(collection: list[Any]) -> list[Any]:
     Time Complexity:
         Worst Case: O(n^2)
         Average Case: O(n^2)
-        Best Case: O(n^2) (no early stopping optimization like iterative version)
+        Best Case: O(n^2) (no early stopping 
+        optimization like iterative version)
 
     Space Complexity:
         O(n) due to recursion stac