title: O(n log m) vs O(n+m) - which is better?
body: <p>Hi Which of this time complexity is better.</p>
  
  <p><code>O(n log m)</code> vs <code>O(n + m)</code></p>
  
  <p>Analyzing these 2 algorithms, which one is better to use practicall on a large scale?</p>
  
  <p>e.g) if n and m are exponentially large it becomes</p>
  
  <p><code>O(2e)</code> vs <code>O(e*(something linear to e))</code></p>
  
  <p><strong>Sample Problem:</strong> Common elements in 2 arrays:</p>
  
  <p>1) 2 pointer approach</p>
  
  <p>2) Using Binary search</p>