title: Is O(n^2) greater than O((n^2)logn)
body: <p>Is O(n^2) is greater than O(n^2 log n) ?<br>
  If yes  ? how ?<br>
  Can we have a simple example for this.<br>
  Also ,<br>
  What is complexity of the code below.  </p>
  
  <pre><code>int unknown(int n){
     int i,j,k=0;
     for(i=n/2;i&lt;=n;i++){
       for(j=2;j&lt;=n;j=j * 2){
           k =k + n/2;
       }
    }
  return k;
  }
  </code></pre>
  
  <p>and What is complexity of return value k ?</p>