O(1) Constant
← Back to Common Classes
Constant time complexity. The algorithm takes the same amount of time regardless of input size. Examples include array access by index, hash table lookup (average case), and stack push/pop operations.
← Back to Common Classes
Constant time complexity. The algorithm takes the same amount of time regardless of input size. Examples include array access by index, hash table lookup (average case), and stack push/pop operations.