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

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

Author: pre-commit-ci[bot]

divide_and_conquer/strassen_matrix_multiplication.py

@@ -113,23 +113,23 @@ def actual_strassen(matrix_a: list, matrix_b: list) -> list:
 
 def strassen(matrix1: list, matrix2: list) -> list:
     """
-    Perform matrix multiplication using Strassen’s algorithm.
+        Perform matrix multiplication using Strassen’s algorithm.
 
-        Examples:
-        >>> strassen([[2,1,3],[3,4,6],[1,4,2],[7,6,7]], [[4,2,3,4],[2,1,1,1],[8,6,4,2]])
-        [[34, 23, 19, 15], [68, 46, 37, 28], [28, 18, 15, 12], [96, 62, 55, 48]]
+            Examples:
+            >>> strassen([[2,1,3],[3,4,6],[1,4,2],[7,6,7]], [[4,2,3,4],[2,1,1,1],[8,6,4,2]])
+            [[34, 23, 19, 15], [68, 46, 37, 28], [28, 18, 15, 12], [96, 62, 55, 48]]
 
-       >>> strassen(
-...     [[3,7,5,6,9],[1,5,3,7,8],[1,4,4,5,7]],
-...     [[2,4],[5,2],[1,7],[5,5],[7,8]]
-... )
+           >>> strassen(
+    ...     [[3,7,5,6,9],[1,5,3,7,8],[1,4,4,5,7]],
+    ...     [[2,4],[5,2],[1,7],[5,5],[7,8]]
+    ... )
 
 
-        Complexity Notes:
-        - Classical matrix multiplication: O(n^3).
-        - Strassen's algorithm: O(n^(log2(7))) ≈ O(n^2.81).
-        - Strassen reduces the number of multiplications from 8 to 7 per recursion,
-          trading them for additional additions/subtractions.
+            Complexity Notes:
+            - Classical matrix multiplication: O(n^3).
+            - Strassen's algorithm: O(n^(log2(7))) ≈ O(n^2.81).
+            - Strassen reduces the number of multiplications from 8 to 7 per recursion,
+              trading them for additional additions/subtractions.
     """
     if matrix_dimensions(matrix1)[1] != matrix_dimensions(matrix2)[0]:
         msg = (