** Next:** 4.6.2 Example of Tree Traversal (Inorder)
** Up:** 4.6 Amortized Algorithm Analysis
** Previous:** 4.6 Amortized Algorithm Analysis

A list is first sorted and then after some use, a random element is included
and then sorted. If we want to do this repeatedly, then amortized
analysis will
indicate insertion sort rather than heapsort or quicksort.

eEL,CSA_Dept,IISc,Bangalore