worst-case complexity

worst possible asymptotic complexity of an algorithm

Facts

3 properties
🏷️ Also known as
en worst-case complexity ar التعقيد في أسوأ حالة fa پیچیدگی بدترین حالت fr complexité dans le pire des cas he המקרה הגרוע ביותר hu legrosszabb eseti komplexitás pt complexidade de pior caso ru сложность алгоритма в худшем случае ru сложность в худшем случае uk найгірший випадок складності zh 最壞情況複雜度
🔖 Identifiers · 3
OpenAlex ID
C96563100
Freebase ID
/m/04zzfdh
Microsoft Academic ID (discontinued)
96563100

Report an error or request removal Lineage (PROV-JSON)

Press Enter · cited answer in seconds

Summary

worst-case complexity is a type of computational complexity[1] and worst-case scenario[2].

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). worst-case complexity. Retrieved November 15, 2026, from https://4ort.xyz/entity/worst-case-complexity
MLA “worst-case complexity.” 4ort.xyz Knowledge Graph, 4ort.xyz, 15 Nov. 2026, https://4ort.xyz/entity/worst-case-complexity.
BibTeX @misc{4ortxyz_worst-case-complexity_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{worst-case complexity}}, year = {2026}, url = {https://4ort.xyz/entity/worst-case-complexity}, note = {Accessed: 2026-11-15}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): worst-case complexity — https://4ort.xyz/entity/worst-case-complexity (retrieved 2026-11-15)

Canonical URL: https://4ort.xyz/entity/worst-case-complexity · Last refreshed:

Edit History

Rolling log of changes to this entity's Wikidata record. Values shown reflect the current state of each edited property — follow the history link to see the precise diff for any edit.

  1. 13d ago · Aldanjack · 2026-11-04 view diff on Wikidata ↗
    Subclass of → computational complexity, worst-case scenario
    Studied by → computation complexity theory, analysis of algorithms, theory of computation
    Different from → worst-case execution time
    "Added [fr] description: complexité d'un algorithme dans le cas le plus défavorable"
Live feed via Wikidata EventStreams. New edits appear within minutes of being made on Wikidata.