Time-complexity Definition

noun

(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.

Classical computers cannot sort a list of size in less than time.
Wiktionary

Other Word Forms of Time-complexity

Noun

Singular:
time-complexity
Plural:
time-complexities

Related Articles

Find Similar Words

Find similar words to time-complexity using the buttons below.

Words Starting With

TTITIM

Words Ending With

YTYITY

Unscrambles

time-complexity

Words Starting With T and Ending With Y

Starts With T & Ends With YStarts With TI & Ends With YStarts With T & Ends With TY

Word Length

15 Letter Words15 Letter Words Starting With T15 Letter Words Ending With Y