title: Big O notation Python function
body: <p><strong>What is the big O of the foo(A) function</strong> (where n equals the length of A)?
  As far as i can tell the foo(4) statement is O(1) for each iteration of the recursion. Also i understand that the running time of the foo(A//8) statement will be logarithmic.</p>
  
  <p><strong>Therefore, will the running time for the program be bigO(log(n)) ?</strong></p>
  
  <p>This function is used for practicing running times for a test.</p>
  
  <pre><code>def foo(A):
      if A &lt;= 6:
          return 7
      return foo(A//8) + foo(4)
  </code></pre>