title: Binary Search Algorithm Time Complexity
body: <p>What I have studied in Cormen book that Time complexity of Binary Saerch Algorithm is:</p>
  
  <ul>
  <li><p>Best Case - O (1) </p></li>
  <li><p>Worst Case - O (log n)</p></li>
  </ul>
  
  <p>My doubt is how come they have written both the complexities directly in Big O notation. Can I say that <strong>Best Case Complexity</strong> is <strong>Theta (1)</strong> and <strong>Worst Case Complexity</strong> is <strong>Theta (log n)</strong> ?</p>