Assertion: algorithm's time | /r/HasProperty | constant
Facets:
Source sentences:
text: An algorithm is said to be constant time (also written as O(1) time) if the value of T(n) is bounded by a value that does not depend on the size of the input.
text: If the number of elements is known in advance and does not change, however, such an algorithm can still be said to run in constant time.
text: For example, a procedure that adds up all elements of a list requires time proportional to the length of the list, if the adding time is constant, or, at least, bounded by a constant.