title: Why does Big-O Notation use O(1) instead of O(k)?
body: <p>If I understand Big-O notation correctly, <code>k</code> should be a constant time for the efficiency of an algorithm. Why would a constant time be considered <code>O(1)</code> rather than <code>O(k)</code>, considering it takes  a variable time? Linear growth <code>( O(n + k) )</code> uses this variable to shift the time right by a specific amount of time, so why not the same for constant complexity?</p>