An algorithm is said to run in constant time if it requires the same amount of time regardless of the input size. Examples: array: accessing any element fixed-size stack: push and pop methods fixed-size queue: enqueue and dequeue methods