Time complexity
In computer science, the time complexity is the computational complexity that describes the amount of computer 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.
Wikipage disambiguates
Algorithmic time complexityComputation timeComputational timeConstant timeCubic timeDouble exponential timeExponential algorithmExponential timeFast algorithmsLinear-timeLinear-time algorithmLinear timeLinear time agorithmLinearithmLinearithmicLinearithmic functionLinearithmic timeLogarithmic timeN log nNlognPolylogarithmic timePolynomial-timePolynomial-time algorithmPolynomial-time solutionPolynomial-time solutionsPolynomial complexityPolynomial timePolynomial time algorithmPolytimeQuadratic timeQuasi-polynomial timeQuasilinear timeRun-time complexityRunning timeSUBEXPStrongly polynomialStrongly polynomial timeSub-exponential timeSub-linear timeSubexponential time
Wikipage redirect
1-planar graph2-satisfiability3SUM99 Bottles of BeerA* search algorithmAF-heapAKS primality testAPXAWPP (complexity)Adaptive sortAdi ShamirAffine scalingAho–Corasick algorithmAja (song)Albert WagelmansAlgorithmAlgorithmic efficiencyAlgorithmic learning theoryAlgorithmic time complexityAlice Cooper and FriendsAll nearest smaller valuesAmortized analysisAnalysis of algorithmsAnalysis of parallel algorithmsAndrew AppelAndrew OdlyzkoAngular resolution (graph drawing)Anna LubiwAnonymous functionAnthropomorphic polygonAntichainApex graphApollonian networkApproximation algorithmApproximations of πApéry's constantArray data structureArt gallery problemAssignment problemAsymptotic computational complexity
Link from a Wikipage to another Wikipage
seeAlso
primaryTopic
Time complexity
In computer science, the time complexity is the computational complexity that describes the amount of computer 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.
has abstract
Em ciência da computação, a co ...... lgoritmo de tempo exponencial.
@pt
En algorithmique, la complexit ...... la complexité des algorithmes.
@fr
En informática, la complejidad ...... goritmo de tiempo polinómico .
@es
In computer science, the time ...... s a polynomial time algorithm.
@en
In informatica, la complessità ...... goritmo in tempo esponenziale.
@it
Při řešení úloh pomocí výpočet ...... slosti na délce vstupních dat.
@cs
В информатике временна́я сложн ...... орого называют полиномиальным.
@ru
Часова складність алгоритму в ...... мом поліноміальної складності.
@uk
في علم الحاسوب، يعتبر تعقيد ال ...... خوارزمية زمن متعددة الحدود .''
@ar
在计算机科学中，算法的时间复杂度（Time complexi ...... ，其中 M ≥ n > 1 的算法被稱作「指數時間算法」。
@zh
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,026,049,783
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
comment
Em ciência da computação, a co ...... de tempo assintótica é O(n3).
@pt
En algorithmique, la complexit ...... comme la complexité en espace.
@fr
En informática, la complejidad ...... factor constante como máximo.
@es
In computer science, the time ...... by at most a constant factor.
@en
In informatica, la complessità ...... temporale asintotica è O(n3).
@it
Při řešení úloh pomocí výpočet ...... ání funkce pro velké hodnoty .
@cs
В информатике временна́я сложн ...... о асимптотически оценить как .
@ru
Часова складність алгоритму в ...... ізняються постійним множником.
@uk
في علم الحاسوب، يعتبر تعقيد ال ...... كل عام كدالة لحجم المدخلات. بت
@ar
在计算机科学中，算法的时间复杂度（Time complexi ...... ，其中 M ≥ n > 1 的算法被稱作「指數時間算法」。
@zh
label
Asymptotická složitost
@cs
Complejidad temporal
@es
Complessità temporale
@it
Complexidade de Tempo
@pt
Complexité en temps
@fr
Tidskomplexitet
@sv
Time complexity
@en
Zeitkomplexität
@de
Временная сложность алгоритма
@ru
Часова складність
@uk