title: How to analize the complexity of this Algorithm? In term of T(n)
body: <blockquote>
    <p>Analyze the complexity of the following algorithms. Said T(n) the running time of the algorithm, determine a function f (n) such that T(n) = O(f(n)). Also, let's say if it also applies T(n) = Θ(f(n)). The answers must be motivated.</p>
  </blockquote>
  
  <p>I never do this kind of exercise.
  Could someone explain what I have to analyze and how can I do it?</p>
  
  <pre><code>j=1,k=0;
  while j&lt;=n do
      for l=1 to n-j do
          k=k+j;
      end for
      j=j*4;
  end while
  </code></pre>
  
  <p>Thank you.</p>