title: What is the efficiency of dividing N positive integers by a given power of 2?
body: <p>For example:</p>
  
  <p>Let's say <code>N = 128</code>.
  We want to divide each positive integer up to and including <code>N</code>, by say, <code>8</code>.
  So we would perform integer division for:</p>
  
  <pre><code>1/8
  2/8
  3/8
  ...
  127/8
  128/8
  </code></pre>
  
  <p>In looking this up, I see that bit shift operations are the way to go and that any good compiler will automatically do it that way in the first place. But nonetheless, I can't seem to find any big O function for this type of algorithm.</p>
  
  <p>To sum up: given a positive integer <code>N</code>, and a number <code>Y</code> which is a power of <code>2</code>, what is the efficiency of an algorithm which divides each of the numbers <code>1,2,3,...,N</code> by <code>Y</code>?</p>