Time complexity
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. For example, if the time required by an algorithm on all inputs of size n is at most 5n3 + 3n for any n (bigger than some n0), the asymptotic time complexity is O(n3).
Wikipage disambiguates
Algorithmic time complexityComputation timeComputational timeConstant timeCubic timeDouble exponential timeExponential algorithmExponential timeFast algorithmsLinear-timeLinear timeLinearithmLinearithmicLinearithmic functionLinearithmic timeLogarithmic timeN log nNlognPolylogarithmic timePolynomial-timePolynomial-time algorithmPolynomial-time solutionPolynomial-time solutionsPolynomial complexityPolynomial timePolynomial time algorithmQuadratic timeQuasi-polynomial timeQuasilinear timeRun-time complexityRunning timeSUBEXPStrongly polynomialStrongly polynomial timeSub-exponential timeSub-linear timeSubexponential timeSublinear-timeSublinear timeSublinear time algorithm
Wikipage redirect
primaryTopic
Time complexity
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. For example, if the time required by an algorithm on all inputs of size n is at most 5n3 + 3n for any n (bigger than some n0), the asymptotic time complexity is O(n3).
has abstract
25بك المحتوى هنا ينقصه الاستشه ...... حاجة للتوسيع. شارك في تحريرها.
@ar
Em ciência da computação, a co ...... lgoritmo de tempo exponencial.
@pt
En algorithmique, la complexit ...... s complexités des algorithmes.
@fr
In computer science, the time ...... an exponential time algorithm.
@en
In informatica, la complessità ...... goritmo in tempo esponenziale.
@it
Unter der Zeitkomplexität eine ...... Komplexitätsklassen zu Grunde.
@de
В информатике временна́я сложн ...... е с экспоненциальным временем.
@ru
在计算机科学中,算法的时间复杂度是一个函数,它定量描述了该算 ...... )) ,其中 M ≥ n > 1 的算法被稱作指數時間算法。
@zh
Wikipage page ID
Wikipage revision ID
741,712,278
date
September 2016
reason
"mathematically speaking" is a ...... r hardware is another subject.
text
In the case of hardware, some ...... re able to run in linear time.
comment
25بك المحتوى هنا ينقصه الاستشه ...... حاجة للتوسيع. شارك في تحريرها.
@ar
Em ciência da computação, a co ...... de tempo assintótica é O(n3).
@pt
En algorithmique, la complexit ...... s complexités des algorithmes.
@fr
In computer science, the time ...... otic time complexity is O(n3).
@en
In informatica, la complessità ...... temporale asintotica è O(n3).
@it
Unter der Zeitkomplexität eine ...... abe angegeben und für immer gr
@de
В информатике временна́я сложн ...... менная сложность равна O (n3).
@ru
在计算机科学中,算法的时间复杂度是一个函数,它定量描述了该算 ...... )) ,其中 M ≥ n > 1 的算法被稱作指數時間算法。
@zh
label
Complessità temporale
@it
Complexidade de Tempo
@pt
Complexité en temps
@fr
Time complexity
@en
Zeitkomplexität
@de
Временная сложность алгоритма
@ru
تعقيد زمني
@ar
时间复杂度
@zh