Texonom
Texonom
/
Science
Science
/Mathematics/Math Field/Analysis/Asymptotic analysis/Asymptotic Notation/Big O/Time Complexity/
Average case time complexity
Search

Average case time complexity

Creator
Creator
Seonglae Cho
Created
Created
2023 Sep 7 6:22
Editor
Editor
Seonglae Cho
Edited
Edited
2023 Sep 17 14:52
Refs
Refs
Random Variable

expected complexity

 
 
 
 
 
 
Average-case complexity
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.
Average-case complexity
https://en.wikipedia.org/wiki/Average-case_complexity
 
 
 

 

Recommendations

Texonom
Texonom
/
Science
Science
/Mathematics/Math Field/Analysis/Asymptotic analysis/Asymptotic Notation/Big O/Time Complexity/
Average case time complexity
Copyright Seonglae Cho