title: Big O notation (Complexity)
body: <p>What is the Big O of this loop?
  -> i understand that the loop itself is going to execute n times. But the task inside of the loop also executes n times right? So would that make this a O(n^2) or do i not combine them and its a simple O(n)? I personally think it is just O(n) because that is how many times the loop is executing but i would just like some clarification as to why or why not it would be? Any explanations would be helpful as i prepare for my midterm.</p>
  
  <pre><code>for(int i = 0; i &lt; a.length;i++){
          a[i] = b[i]
      }
  </code></pre>