title: Solving the recurrence T(n) = T(n / 2) + O(1) using the Master Theorem?
body: <p>I'm trying to solve a recurrence relation to find out the complexity of an algorithm using the Master Theorem and its recurrences concepts, how can I prove that:</p>
  
  <blockquote>
    <p><code>T(n) = T(n/2)+O(1)</code></p>
  </blockquote>
  
  <p>is</p>
  
  <blockquote>
    <p><code>T(n) = O(log(n)) ?</code></p>
  </blockquote>
  
  <p>Any explanation would be apprecciated!!</p>