Analysis of algorithms
In computer science, the analysis of algorithms is the process of finding the computational complexity of algorithms – the amount of time, storage, or other resources needed to execute them. Usually, this involves determining a function that relates the length of an algorithm's input to the number of steps it takes (its time complexity) or the number of storage locations it uses (its space complexity). An algorithm is said to be efficient when this function's values are small, or grow slowly compared to a growth in the size of the input. Different inputs of the same length may cause the algorithm to have different behavior, so best, worst and average case descriptions might all be of practical interest. When not otherwise specified, the function describing the performance of an algorithm i
academic discipline
known for
Wikipage disambiguates
"uniform cost model"2012 in science3D sound localizationAV1Abstract data typeAccounting method (computer science)AlgorithmAlgorithm analysisAlgorithmic PuzzlesAlgorithmic complexityAlgorithmic efficiencyAlgorithmic game theoryAlgorithmicsAmortizationAmortized analysisAnalysis of parallel algorithmsAnalytic CombinatoricsAndrew OdlyzkoAndrey KolmogorovApproximate Bayesian computationAsymptotic analysisAsymptotic computational complexityAviezri FraenkelBarbara SimonsBig O notationBinary logarithmBiological neuron modelBisection (software engineering)Boyer–Moore majority vote algorithmBrigitte ValléeBucket sortBézier curveC++ Technical Report 1CURE algorithmCYK algorithmCalifornia_Institute_of_TechnologyChecksumCheryl PraegerChris UmansClifford Stein
Link from a Wikipage to another Wikipage
field
known for
primaryTopic
Analysis of algorithms
In computer science, the analysis of algorithms is the process of finding the computational complexity of algorithms – the amount of time, storage, or other resources needed to execute them. Usually, this involves determining a function that relates the length of an algorithm's input to the number of steps it takes (its time complexity) or the number of storage locations it uses (its space complexity). An algorithm is said to be efficient when this function's values are small, or grow slowly compared to a growth in the size of the input. Different inputs of the same length may cause the algorithm to have different behavior, so best, worst and average case descriptions might all be of practical interest. When not otherwise specified, the function describing the performance of an algorithm i
has abstract
Analiza algorytmu to sposób ok ...... ru są jednakowo prawdopodobne.
@pl
Analýza algoritmů je v matemat ...... strojový čas byl velmi drahý.
@cs
El análisis de algoritmos es u ...... ero de 1000 dígitos cada uno).
@es
Em ciência da computação, a an ...... m uma máquina rápida. Sempre."
@pt
In computer science, the analy ...... re needed to return an answer.
@en
L'analyse de la complexité d'u ...... un algorithme en particulier.
@fr
L'anàlisi d'algorismes és una ...... ho amb enters de 1000 dígits).
@ca
Аналіз алгоритмів — це процес ...... симум log2 n + 1 одиниць часу.
@uk
تحليل الخوارزميات هو تحديد مقد ...... از خوارزمية لحل مسألة تحسبيبة.
@ar
アルゴリズム解析とは、アルゴリズムの実行に必要とされるリソー ...... 回答を得るまでに最大で log2 N+1 単位時間を要する。
@ja
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,017,448,572
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
type
comment
Analiza algorytmu to sposób ok ...... ć niezwykle długie obliczenia.
@pl
Analýza algoritmů je v matemat ...... a paměťovou složitost výpočtu.
@cs
El análisis de algoritmos es u ...... ueda de algoritmos eficientes.
@es
Em ciência da computação, a an ...... minado problema computacional.
@pt
In computer science, the analy ...... performance of an algorithm i
@en
L'analyse de la complexité d'u ...... un algorithme en particulier.
@fr
L'anàlisi d'algorismes és una ...... ecerca d'algorismes eficients.
@ca
Аналіз алгоритмів — це процес ...... адність для найгірших випадків
@uk
تحليل الخوارزميات هو تحديد مقد ...... از خوارزمية لحل مسألة تحسبيبة.
@ar
アルゴリズム解析とは、アルゴリズムの実行に必要とされるリソー ...... の定数を隠れた定数（hidden constant）と呼ぶ。
@ja
label
Analiza algorytmów
@pl
Analyse de la complexité des algorithmes
@fr
Analysis of algorithms
@en
Analýza algoritmů
@cs
Anàlisi d'algorismes
@ca
Análise de algoritmos
@pt
Análisis de algoritmos
@es
Аналіз алгоритмів
@uk
تحليل الخوارزميات
@ar
アルゴリズム解析
@ja