def main():
array_one = genMatrix()
array_two = genMatrix2()
start_time = time.time()
arr = multiply_matrices(array_two)
print((time.time() - start_time))
printSubarray(arr)
#!/usr/bin/env python3
import argparse
import numpy as np
import matrixUtils
import time
a = matrixUtils.genMatrix()
b = matrixUtils.genMatrix2()
c = np.zeros((len(a), len(a)))
start = time.time()
for i in range(len(a)):
for j in range(len(b[0])):
for k in range(len(b)):
c[i][j] += a[i][k] * b[k][j]
stop = time.time()
print("time: ", (stop - start))
matrixUtils.printSubarray(c, len(c))
from matrixUtils import genMatrix, genRandomMatrix, writeToFile, multiplyMatrix
#Debugger
import numpy as np
if __name__ == "__main__":
A = genMatrix(4, 100)
B = genMatrix(4, 2)
result = multiplyMatrix(A, B)
result2 = np.matmul(A, B)
print(result)
print(result2)
writeToFile(result, "result.txt")
#Jessica Redekop
#Parallel Programming Assignment 1 Part 1
#Feb 2, 2020
import matrixUtils
import time
#making size of quare matrix modular
size = 256
#generating matricies using the utils
matrix_1 = matrixUtils.genMatrix(size, 2)
matrix_2 = matrixUtils.genMatrix2(size, 3)
#creating a same size matrix filled with 0s
matrix_sol = [[0] * size for i in range(size)]
#starting timer
start = time.time()
#nested for loops because I don't understand the syntax for python list comprehension
for i in range(size):
for j in range(size):
for k in range(size):
matrix_sol[i][j] += matrix_1[i][k] * matrix_2[k][j]
#stopping timer
stop_time = time.time() - start
print("time: ")
print("%s seconds" % stop_time)
print("\n")