Difference between revisions of "Time complexity"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) (Created page with "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 (...") |
(No difference)
|
Revision as of 10:49, 16 October 2016
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.
See also
External links
- Time complexity
