title: For what values of m (in terms of n) is O(m*n) better than O(n^2) (and why)?
body: <p>I usually am able to answer this sort of question by graphing on Desmos, but I'm having trouble figuring out how to represent these graphs to visualise the difference in steepness, especially as m tends to n and m goes beyond n.</p>
  
  <p>An example where this can come up is "compare two arrays to find if there are any duplicates from the first array in the second array". Here, <code>m</code>, and <code>n</code> are the lengths of the arrays. If m and n are equal, then the complexity is <code>n^2</code> for a nested-loop pairwise comparison solution. But if they are unequal, is the complexity graph 'worse' than <code>n^2</code>? I can't seem  to figure out how to graph this to check, or even express this mathematically.</p>