Running Time Complexity of O (n / 2)
<p>I once understood this but not anymore. Lets say I have an algorithm that will return the number in the middle of an array.</p>

<pre><code>for (int i = 0; i &lt; nums.length; i++) {
  if (i == nums.length / 2) return nums[i];
}
</code></pre>

<p>The worst case of this will always be O (n / 2) right? There is no worse case than this. But how come we just conclude that it is O(n) ?</p>