Time Complexity for Multiplying two NxN Matrices

• Unit Computational Step:

  A multiplication/addition.
  

• Problem Size:

  The size of the matrices (N)..
  

• Execution Time:

  For two 10x10 matrices it takes approx 1000 mults/adds.
  

• Establish Time Complexity Relationship:

  Multiplying two NxN matrices takes
  
  Time Complexity = N*N*N

Previous slide

Next slide

Back to first slide

View graphic version