Worst-case complexity

Worst-case complexity

Common

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class
Notion
Domain
Science and technology
In collections
Nobody has pulled it yet.

What Wikipedia says

In computer science (specifically computational complexity theory), the worst-case complexity measures the resources (e.g. running time, memory) that an algorithm requires given an input of arbitrary size (commonly denoted as n in asymptotic notation). It gives an upper bound on the resources required by the algorithm.

Excerpt from the Wikipedia article “Worst-case complexity”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Open free boosters and add Worst-case complexity to your collection.

Play for free

Related cards