mult2.py

def brute_mult(A,B):
    n = len(A)
    result = [[0] * n for _ in A]
    for i in range(n):
        for j in range(n):
            for k in range(n):
                result[i][j] += A[i][k] * B[k][j]
    return result

def mat_add(A,B):
    n = len(A)
    result = [[0] * n for _ in A]
    for i in range(n):
        for j in range(n):
            result[i][j] += A[i][j] + B[i][j]
    return result

def strassen_mult(A,B):
    if len(A)==1:
        result = brute_mult(A,B)
        return result

def get_quadrant(a, hhalf, vhalf):
    n = len(a)
    hstart = hhalf * n//2
    vstart = vhalf * n//2
    return [row[vstart:vstart + n//2] for row in a [hstart:hstart + n//2]]

def assemble (top_left, top_right, bottom_left, bottom_right):
    n = len(top_left)