Content deleted Content added
Dokidaki-ylc (talk | contribs) m Add Best, worst and average case in "see also" |
mNo edit summary Tags: Reverted Mobile edit Mobile app edit iOS app edit |
||
Line 1:
{{Short description|Computational theory}}
In [[computational complexity theory]], the '''average-case complexity''' of an [[algorithm]] is the amount of some computational resource (typically time) used by the algorithm, averaged over all possible inputs. It is frequently contrasted with [[worst-case complexity]] which considers the maximal complexity of the algorithm over all possible inputs.
| |||