CSC 451.1: Topics in Theoretical Computing Science 1

FALL 1998-99

Assignment #3

Instructor: Dr. Pawan Lingras

 Due Date: November 4,1998

Implement the straightforward and Strassen's algorithms for multiplying large matrices. Verify that both algorithms given identical answers by printing the results for small matrices. Your program should also output the number of multiplications and additions required for each of the algorithms. Compare the time required for both of these algorithms by testing for large randomly generated matrices.