There are many solutions for a particular problem.Means, For one problem we can design more than one algorithms.But how to find which algorithms are good and which are bad.

There are two ways to find the Ideal Algorithms for any particular problem as given below:-

**Time**:-An algorithm is good which takes less time.**Space**:-An algorithm is good which takes less space(storage).

The efficiency of any algorithms fully dependent on time,space and other resources which are needed to execute any algorithms.

**:-**

__Asymptotic Notations__Asymptotic notations are the mathematical notations.It is used to represent the complexity of algorithms.This allows us to analyze an algorithm's running time and its behaviors. There are mainly three asymptotic notations to find the complexity of algorithms as given below:-