an algorithm can be described as O( 1) even if it takes more than one step. Let’s say that a particular algorithm always takes three steps, rather than one—but it always takes these three steps no matter how much data there is.522 ↱
A Common-Sense Guide to Data Structures and Algorithms
Level Up Your Core Programming Skills
Jay Wengrow