What are the causes of complexity of an Algorithm?

The causes of complexity of an algorithm are:-

·         Base case complexity (Ω): It gives the asymptotic lower bound for all the instances of input on the running time of an algorithm. Big Omega (Ω) notation is used to measure the asymptotic lower bound of the algorithm.

·         Average case complexity: It gives average number of steps required for all the instances of input on the running time of an algorithm. The mathematical average concept is used to measure it.

·         Worst case complexity: It gives the asymptotic upper bound for all the instances of input on the running time of an algorithm. It insures that no input can overcome the running time limit set by worst case complexity. Big Oh (Ο) notation is used to measure the asymptotic upper bound of the algorithm.