title: How can two algorithms one with O(n^2) the other Ω(n) has about the same run time?
body: <p>How can two algorithms</p>
  
  <ul>
  <li>one with <code>O(n²)</code></li>
  <li>the other with <code>Ω(n)</code></li>
  </ul>
  
  <p>have the same practical run time, when testing the algorithms with a large number?</p>