title: O notation, Duelling Algorithms
body: <p>How would i find the smallest positive integer for which algorithm B out-performs algorithm A?</p>
  
  <pre><code>A = n/4, B = 8×log2n(Base of 2 Not 2n)
  
  A = n^3/10, B = 5×n2
  
  A = n^2/2, B = 20×n×log2n(Base of 2 Not 2n)
  
  A = n^4, B = 16×n2×n
  </code></pre>
  
  <p>It would be greatly appreciated if someone could help me find answers to these :)</p>