title: Are there any cases where you would prefer a higher big-O time complexity algorithm over the lower one?
body: <p>Are there are any cases where you would prefer <code>O(log n)</code> time complexity to <code>O(1)</code> time complexity? Or <code>O(n)</code> to <code>O(log n)</code>?</p>
  
  <p>Do you have any examples?</p>