Найти детерминант квадратной матрицы без numpy.linalg.det

import random
n=int(input())
m=n
A=[[0]*m for i in range(n)]
for i in range(n):
    for j in range(m):
        A[i][j]=random.randint(-9, 9)        
for i in range(n):
    for j in range(m):
        print(A[i][j], end=" ")
    print()
print()
 
if n==2:
    d=A[0][0]*A[1][1]-A[0][1]*A[1][0]
    print(d)
elif n==3:
    d=(A[0][0]*A[1][1]*A[2][2])+(A[0][1]*A[1][2]*A[2][0])+(A[0][2]*A[1][0]*A[2][1])-(A[0][2]*A[1][1]*A[2][0])-(A[0][0]*A[1][2]*A[2][1])-(A[0][1]*A[1][0]*A[2][2])
    print(d)

def det2(matrix):
    return matrix[0][0] * matrix[1][1] - matrix[0][1] * matrix[1][0]
 
def minor(matrix, i, j):
    tmp = [row for k, row in enumerate(matrix) if k != i]
    tmp = [col for k, col in enumerate(zip(*tmp)) if k != j]
    return tmp
 
def determinant(matrix):
    size = len(matrix)
    if size == 2:
        return det2(matrix)
 
    return sum((-1) ** j * matrix[0][j] * determinant(minor(matrix, 0, j))
               for j in range(size))
 
m = [[2,4,1,1],
     [0,2,1,0],
     [2,1,1,3],
     [4,0,2,3]]
 
print(determinant(m))

def minor(x, i, j):
    m = [row[:] for row in x]
    for row in m:
        row.pop(j)
    m.pop(i)
    return m
 
def det(x):    
    if len(x)==2:
        return x[0][0]*x[1][1]-x[0][1]*x[1][0]
    D = 0
    for i in range(len(x[0])):
        A = det(minor(x, 0, i))
        D+=(x[0][i])*A*((-1)**(1+i))
    return D

if len(x) == 1:
    return x[0][0]