Start free trial
Take Naologic for a spin today, no credit card needed and no obligations.
Start free trial

Asymptotic Computational Complexity - What does O 1 represent in big-O notation?


O(1) from big-The use of "O" notation indicates that the runtime of an algorithm is constant, independent of the input size. Bookmarks are a practical illustration of this as they enable readers to easily find the page they were on before, regardless of how long the book is.