Revision as of 21:31, 27 March 2009 edit Michael Hardy (talk \| contribs) Administrators 210,596 edits →See also ← Previous edit		Revision as of 16:14, 11 August 2009 edit undo RobinK (talk \| contribs) Extended confirmed users, Pending changes reviewers 3,059 edits merge suggestion Next edit →
Line 1: {{mergeto\|Best, worst and average case\|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