Временная сложность — мера того, как время выполнения алгоритма растёт с размером его входных данных. Обычно она выражается через подсчёт elementary operations и абстрагируется от постоянных множителей.
The computational complexity that describes the amount of time it takes to run an algorithm. Time complexity is commonly estimated by counting the number of elementary operations performed by the algorithm, supposing that each elementary operation takes a fixed amount of time to perform. Thus, the amount of time taken and the number of elementary operations performed by the algorithm are taken to differ by at most a constant factor.