Its a form of notation to describe how an algorithm scales relative to its input size increasing. I understand that O (1) means it takes the same amount of time regardless of input size.