<<< Complexity of Algorithm

1. Time Complexities: e.g. 

1. O(1) - Constant Time

2. O(n) - Linear Time: e.g.

1. Linear search

3. O(log n) - Logarithmic Time Algorithm: e.g. 

1. Binary Search Algorithm

2. Binary Conversion Algorithm

4.  O(n log n) - Linearithmic Time: e.g. 

1. Merge sort algorithm (divide & conquer algorithm)

5.  O(n^2) - Quadratic Time: e.g. 

1. Bubble sort algorithm

6. O(n^3) - Cubic Time (same principle as O(n^2))

7. O(2^n) - Exponential Time: e.g. 

1. Brute Force Algorithm: e.g. [Linear search (special case)]

2. Selection sort algorithm

8. O(n!) - Factorial Time: THE SLOWEST!!! e.g. 

1. Travel Salesman Problem (TSP)

Note: Common Running Time: e.g. Min Time (fastest O(1)), Max Time (slowest O(n!))

2. Space Complexities: Auxiliary space + Input space 

#Programming #Algorithm #CodeAnalysis #TimeComplexity #SpaceComplexity #AbdurRahimRatulAliKhan

>>>