The efficiency of an algorithm depends on two parameters:

- Time Complexity
- Space Complexity

**Time Complexity:** Time Complexity is defined as the number of times a particular instruction set is executed rather than the total time taken. It is because the total time taken also depends on some external factors like the compiler used, the processor’s speed, etc.

**Space Complexity:** Space Complexity is the total memory space required by the program for its execution.

Also Read: What is Big-Omege Notation (Ω) & Big-Theta Notation (Θ)?

## Types Of Time Complexity :

**Best Time Complexity:**Define the input for which the algorithm takes less time or minimum time. In the best case calculate the lower bound of an algorithm. Example: In the linear search when search data is present at the first location of large data then the best case occurs.**Average Time Complexity:**In the average case take all random inputs and calculate the computation time for all inputs.

And then we divide it by the total number of inputs.**Worst Time Complexity:**Define the input for which the algorithm takes a long time or maximum time. In the worst calculate the upper bound of an algorithm. Example: In the linear search when search data is present at the last location of large data then the worst case occurs.

Algorithm | Time Complexity | ||
---|---|---|---|

| Best | Average | Worst |

Selection Sort | Ω(n^2) | θ(n^2) | O(n^2) |

Bubble Sort | Ω(n) | θ(n^2) | O(n^2) |

Insertion Sort | Ω(n) | θ(n^2) | O(n^2) |

Heap Sort | Ω(n log(n)) | θ(n log(n)) | O(n log(n)) |

Quick Sort | Ω(n log(n)) | θ(n log(n)) | O(n^2) |

Merge Sort | Ω(n log(n)) | θ(n log(n)) | O(n log(n)) |

Also Read: What is Asymptotic Notation & Big-Oh Notation?