title: Why would an O(n^2) algorithm run quicker than a O(n) algorithm on the same input?
body: <p>Two algorithms say A and B are written to solve the same problem.
  Algorithm A is O(n).
  Algorithm B is (n^2).
  You expect algorithm A to work better.</p>
  
  <p>However when you run a specific example of the same machine, Algorithm B runs quicker.
  Give the reasons to explain how such a thing happen?</p>