title: Computational Complexity of Algorithm in Big Oh, Big Omega and Theta
body: <p>I am trying to solve the following question on computational complexity:</p>
  
  <blockquote>
    <p>Compute the computational complexity of the following algorithm and
    write down its complexity in Big O, Big Omega and Theta</p>
  
  <pre><code>for i=1 to m {
     x(i) =0;
     for j=1 to n {
        x(i) = x(i) + A(i,j) * b(j)
     }
  }
  </code></pre>
    
    <p>where A is mxn and b is nx1.</p>
  </blockquote>
  
  <p>I ended up with Big O <code>O(mn^2)</code>
  Big <code>Omega(1)</code> and <code>Theta(mn^2)</code>.</p>