Analysis of Algorithms Articles

Asymptotic Complexity

Arnab Chakraborty

Updated on 02-Aug-2019 5K+ Views

Asymptotic AnalysisUsing asymptotic analysis, we can get an idea about the performance of the algorithm based on the input size. We should not calculate the exact running time, but we should find the relation between the running time and the input size. We should follow the running time when the size of input is increased.For the space complexity, our goal is to get the relation or function that how much space in the main memory is occupied to complete the algorithm.Asymptotic BehaviorFor a function f(n) the asymptotic behavior is the growth of f(n) as n gets large. Small input values ...