title: Time complexities of three algorithms are given. Which should execute the slowest for large value of N?
body: <p>Options given:</p>
  <pre><code>(a) O(2N)
  (b) O(N)
  (c) O(logN)
  (d) O(n^2)
  </code></pre>
  <p>I have encountered this questions in the online examination. The Correct option they are mentioning is O(logN). But in my perspective it should be O(2N), because the &quot;n^2&quot; they given, &quot;n&quot; is in lowercase, otherwise it should be O(N^2). Someone help me with the proper answer.</p>
  <p><a href="https://i.stack.imgur.com/hh2Dj.jpg" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/hh2Dj.jpg" alt="enter image description here" /></a></p>