AMORTIZED ALGORITHMS AND THEIR ANALYSIS

AMORTIZED ALGORITHMS

Algorithms are quantitative techniques to analyze the solution. It may range from analyzing an ant's path to the analysis of the effective distance travelld by the earth

INTRODUCTIONS

Well we've all seen the case of the merge sort. IN case of the merge sort, the elements in a vector are spiced into smaller bits until a single element is obtained at the end. Then , the single element is further merged with the other elements and this process continues. A small deep instance into this problem gives us a conclusion that the maximum time is consumed in the process of splicing the vectors. Well, this is the point that we need in this topic!!!! The very fact that some operations or part of an algorithm consumes more time leads us to study one of the marvels of computing called Amortized Algorithms