Determinant using standard Python (Leibniz rule)

calculate_determinant_std_python.py

# Not for efficiency

def permutations(data, sign=0):
    return ([(1, data)]
            if len(data) == 1 else
            [(sign * -1 if idx % 2 == 1 else sign, [value] + nested_permutation)
             for idx, value in enumerate(data)
             for sign, nested_permutation in permutations(data[:idx] + data[idx+1:])]
           )

def determinant(m):
    indices = range(len(m))
    return sum(sign * np.prod([m[i][permutation[i]] for i in indices])
               for sign, permutation
               in permutations(indices))