title: time complexity after sorting and using binary search
body: <p>what will the time complexity be if I merge sort an array and apply a binary search function on it ? will it be <code>O(log n)</code>?</p>
  <p>because</p>
  <pre><code>o(log n) + o(n log n) = O(log n)
  </code></pre>