Time complexity - Wikipedia, the free encyclopedia

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[1]:226. The time complexity of an algorithm is commonly expressed using bi

en.wikipedia.org