Revision as of 14:43, 26 August 2009 edit RobinK (talk \| contribs) Extended confirmed users, Pending changes reviewers 3,059 edits No edit summary ← Previous edit		Revision as of 10:21, 2 September 2009 edit undo Harej bot (talk \| contribs) Bots 21,332 edits m using discuss= in merge template (for syntax standardization) Next edit →
Line 1: {{mergeto\|Best, worst and average case\|discuss=Talk:Best, worst and average case#Merger proposal\|date=August 2009}} '''Average-case complexity''' is a subfield of [[computational complexity]] theory that studies the complexity of algorithms on random inputs.

Average-case complexity: Difference between revisions