title: How is it possible that O(1) constant time code is slower than O(n) linear time code?
body: <blockquote>
    <p>"...It is very possible for O(N) code to run faster than O(1) code for specific inputs. Big O just describes the rate of increase."</p>
  </blockquote>
  
  <p>According to my understanding:</p>
  
  <ul>
  <li>O(N) - Time taken for an algorithm to run based on the varying values of input N.</li>
  <li>O(1) - Constant time taken for the algorithm to execute irrespective of the size of the input e.g. <code>int val = arr[10000];</code></li>
  </ul>
  
  <p>Can someone help me understand based on the author's statement?  </p>
  
  <ol>
  <li>O(N) code run faster than O(1)?</li>
  <li>What are the specific inputs the author is alluding to?</li>
  <li>Rate of increase of what? </li>
  </ol>