2017-10-28T19:30:09Z
Toward Green Mobility: the evolution of transport - Jesse Ausubel, Cesare Marchetti, Perrin Meyer
phe.rockefeller.edu
In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the length of the string representing the input. The time complexity of an algorithm is commonly expressed using big O notation, which excludes coefficients and lower order terms. When expressed this way, the time complexity is said to be described ''asymptotically'', i.e., as the input size goes to infinity.
More at: Time complexity