EGAVE

time complexity

About 0.25 uses per million words.

Meaning

  1. noun 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.

Similar words

linear time complexity function space complexity polynomial time time constant polytime stopping time kolmogorov complexity complexity class big o notation

Save “time complexity” to learn later