The primary motive to use DSA is to solve a problem effectively and efficiently. How can you decide if a program written by you is efficient or not? This is measured by complexities. Complexity is of two types:
- Time complexity: Time complexity is used to measure the amount of time required to execute the code.
- Space complexity: Space complexity means the amount of space required to execute successfully the functionalities of the code.
- Big-O notation (
Ο)
Ω), which describes the best-case scenario, and
θ), which gives the average complexity of an algorithm.
The above figure shows an example of the rates of growth of algorithms. The most used notation in the analysis of a code is the Big-O notation which gives an upper bound of the running time of the code (or the amount of memory used in terms of input size).
|
The funny thing is when you start feeling happy alone, that’s when everyone decides to be with you. — Jim Carrey |