Worst-case and average-case analyses
A particular algorithm may require different times to solve different problems of the same size.
For example: searching for an element in a sorted list.
Worst-case analysis gives the pessimistic time estimates.
Average-case analysis attempts to determine the average amount of time that A requires to solve the problems of size N.