title: How can I show that linear search is faster than binary i current case?
body: <p>I have a sorted list of elements : </p>
  
  <pre><code>c f g o p q r t w 
  </code></pre>
  
  <p>I need to find element <code>f</code> using binary search,I did it. 
  I have also found this element using linear search in 2 comparisons. 
  Now I need to show that in this case linear is faster than binary,how can I do it? 
  Thank you!</p>