Computational complexity(Big-O)

How the work a program does grows as the input grows. O(n) means one pass, O(n squared) means a pass inside a pass, O(log n) means halving the search each step. It predicts slowness before a timer is needed.

• See also: Hash map
• See also: Index
• Used in: Data Structure Basics

Back to the glossary