From d90f331d19de32694d7dc440a323b8ed38fc6bd3 Mon Sep 17 00:00:00 2001 From: algobytewise Date: Tue, 23 Mar 2021 12:29:27 +0530 Subject: [PATCH] fix divide_and_conquer-folder --- divide_and_conquer/max_difference_pair.py | 4 ++-- divide_and_conquer/strassen_matrix_multiplication.py | 2 +- 2 files changed, 3 insertions(+), 3 deletions(-) diff --git a/divide_and_conquer/max_difference_pair.py b/divide_and_conquer/max_difference_pair.py index b976aca43..ba7203595 100644 --- a/divide_and_conquer/max_difference_pair.py +++ b/divide_and_conquer/max_difference_pair.py @@ -1,7 +1,7 @@ -from typing import List +from typing import List, Tuple -def max_difference(a: List[int]) -> (int, int): +def max_difference(a: List[int]) -> Tuple[int, int]: """ We are given an array A[1..n] of integers, n >= 1. We want to find a pair of indices (i, j) such that diff --git a/divide_and_conquer/strassen_matrix_multiplication.py b/divide_and_conquer/strassen_matrix_multiplication.py index 29a174dae..ca10e04ab 100644 --- a/divide_and_conquer/strassen_matrix_multiplication.py +++ b/divide_and_conquer/strassen_matrix_multiplication.py @@ -121,7 +121,7 @@ def strassen(matrix1: list, matrix2: list) -> list: dimension2 = matrix_dimensions(matrix2) if dimension1[0] == dimension1[1] and dimension2[0] == dimension2[1]: - return matrix1, matrix2 + return [matrix1, matrix2] maximum = max(max(dimension1), max(dimension2)) maxim = int(math.pow(2, math.ceil(math.log2(maximum))))