Computer science Algorithms as mathematical objects Concept
Analysis of algorithms
Summary
The analysis of algorithms determines the resources, chiefly time and memory, that an algorithm needs, as a function of the size of its input. Results are usually stated up to constant factors with big O notation, in the worst case or on average over a distribution of inputs. It lets one compare algorithms independently of the machine and predict how they behave on large inputs.
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | 2TSJFYVFS8 |
|---|---|
| URI | m2://2TSJFYVFS8 |
| Kind | concept |
| Writing | W0 stub |
| MSC | 68W40, 68Q25 |
| Same as | |
| Changed | 3 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.