title: What is the big-o notation for this algorithm?
body: <p>What will be the big-o notation for the algorithm that consist of multiplication of N in the loop.</p>
  
  <pre><code>void testing(int n) {
      for(int i =0; i&lt;n;i++) {
          n=n*2;
          System.out.println("hi"+n);
      }
  }
  </code></pre>