ANALYSIS OF ALGORITHM
In computer science, the analysis of algorithms is the determination of the amount of resources (such as time and storage) necessary to execute them.
TYPES OF COMPLEXITY ANALYSIS
Space Complexity Analysis: It represents the amount of storage space required by an algorithm during the course of its execution.
Time Complexity Analysis: It represents the amount of time taken by an algorithm during the course of its execution.
ASYMPTOTIC NOTATIONS
Asymptotic Notations allow us to analyze an algorithm's running time (or space) by identifying its behavior as the input size for the algorithm increases. This is also known as an algorithm's growth rate.
TYPES OF ASYMPTOTIC NOTATIONS
1. Big Oh
2. Big Omega
3. Big Theta
4. Little Oh
5. Little Omega
Related Post
MERGE SORT
Merge Sort is a divide and conquer algorithm that was invented by John von Neumann in 1945.
Conceptually, a mer ... 
Selection Sort
Selection Sort is conceptually the most simplest sorting algorithm which sorts an array by repeatedly finding th ... 
QUICK SORT
Quick Sort is a divide and conquer algorithm. It first divides a large array into two smaller sub-arrays: the lo ... - DS searching techniques or algorithms with complexity
In computer science, a search algorithm is an algorithm that retrieves information in a computer's storage. Sea ...
- Insertion Sort
Insertion Sort is the simplest sorting algorithm which sorts the array by shifting elements one by one.
It works the ...