Time Complexity - What is O 1 complexity?

An algorithm is said to possess a constant time complexity, or order O(1), when its performance is unaffected by the size of the input (n). In other words, the execution time remains steady regardless of the input size. An example of this would be an algorithm designed to return the first element of an array.