time complexity

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

Noun[edit]

time complexity (usually uncountable, plural time complexities)

  1. (computer science) The amount of time an algorithm requires to run, as a function of the amount of input, measured in such a way as to ignore constant terms and multiplication by constant terms.
    Coordinate terms: space complexity, time-space complexity

Translations[edit]

See also[edit]