Definitions from Wikipedia (Worst-case complexity)

▸ noun:  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 in asymptotic notation).


▸ Words similar to worst-case complexity
▸ Usage examples for worst-case complexity

▸ Idioms related to worst-case complexity
▸ Wikipedia articles (New!)
▸ Words that often appear near worst-case complexity
▸ Rhymes of worst-case complexity

▸ Invented words related to worst-case complexity