Notes Time and space complexity. $O(1)$ describes an algorithm that always runs at a constant time no matter its input. Sources Top Data Structures and Algorithms every developer must know - From https://github.com/JamieBort/LearningDirectory/tree/master/BigONotation#resources