Worst-case complexity
id:
worst-case-complexity-318-15189344
title:
Worst-case complexity
text:
In computer science, the worst-case complexity measures the resources that an algorithm requires given an input of arbitrary size. It gives an upper bound on the resources required by the algorithm. In the case of running time, the worst-case time complexity indicates the longest running time performed by an algorithm given any input of size n, and thus guarantees that the algorithm will finish in the indicated period of time. The order of growth of the worst-case complexity is commonly used to
brand slug:
wiki
category slug:
encyclopedia
description:
Upper bound on resources required by an algorithm
original url:
https://en.wikipedia.org/wiki/Worst-case_complexity
date created:
date modified:
2023-09-11T10:12:55Z
main entity:
{"identifier":"Q8037118","url":"https://www.wikidata.org/entity/Q8037118"}
image:
fields total:
13
integrity:
14