title: Big O notation algorithms
body: <p><a href="https://i.stack.imgur.com/aAGY9.jpg" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/aAGY9.jpg" alt="enter image description here" /></a></p>
  <p>I have this problem and I don't understand how the answer for quadratic/logarithm and Exponential order is 40, 15 &amp; 100. I know the formulas for these are O(n2), O(log(n)), O(2n) but not able to correlate the answers with these formulas. What is n in this problem? Is it the size of the data set (20) or is it 2? Please let me know your thoughts.</p>