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