title: Time complexity of the expression
body: <p>I am trying to find the time complexity of the following:</p>
  
  <pre><code>Algorithm C solves X by dividing a problem of size n into 2 subproblems of size n/2, recursively solving each sub problem, and then combining the solutions in O(n^3) time.
  </code></pre>
  
  <p>My try:</p>
  
  <pre><code>2 T(n/2) + O(n^3)
  </code></pre>
  
  <p>Can I write directly that the time complexity will be : O(n^3)</p>