Page 3 - Lesson Note-Algorithmic Efficiency
P. 3
Three broad cases to think for algorithmic efficiency is:
i) Best case – when the inputs are as favourable as possible, minimum running time
over all the possible input of a given size. (first match in a linear search)
ii) Worst case – maximum running time over all the possible input of a given size. (last
match in a linear search)
iii) Average case –it is the average running time over all the possible input of a given
size. (a match in a middle in linear search)
