title: matrix multiplication algorithm time complexity
body: <p>I came up with this algorithm for matrix multiplication. I read somewhere that matrix multiplication has a time complexity of o(n^2). 
  But I think my this algorithm will give o(n^3). 
  I don't know how to calculate time complexity of nested loops. So please correct me.</p>
  
  <pre><code>for i=1 to n
     for j=1 to n    
       c[i][j]=0
       for k=1 to n
           c[i][j] = c[i][j]+a[i][k]*b[k][j]
  </code></pre>