Asymptotic Complexity

Asymptotic  Complexity

If an algorithm process large amount of data it is observed that there is a certain term  in the complexity function that grows the fastest , so any other term that do not substantially contribute to the functions magnitude should be eliminated from the function .the resulting  functions so calculated gives  only an  approximate time complexity of the original function, However this approximation is sufficiently close to the original specially for a function that process large amount of data.This measure of  time complexity of an algorithm where we disregard certain terms of a function to express the efficiency of algorithm is called asymptotic  complexity.