In computer science, understanding the time complexity of algorithms is crucial. Big-O notation is commonly used to describe the performance or complexity of an algorithm.
Constant Time Complexity describes an algorithm that will always execute in the same time (or space) regardless of the size of the input data set.
var array = [1, 2, 3, 4, 5];
array[0]; // This is a constant time look-up