title: What is the worst case time complexity for this algorithm?
body: <pre><code>procedure matrixvector(n:integer);
  var i,j:integer;
  begin
    for i&lt;-1 to n do begin
      B[i] = 0;
      C[i] = 0;
      for j&lt;-1 to i do 
        B[i]&lt;- B[i]+ A[i,j];
      for j&lt;-n down to i+1 do
        C[i]&lt;-C[i] + A[i,j]
    end
  end;
  </code></pre>