Binary Tree Sort Is More Robust Than Quick Sort In Average Case
Soubhik Chakraborty · International Journal of Computer Science Engineering and Applications · 2012
Average case complexity, in order to be a useful and reliable measure, has to be robust.The probability distribution, generally uniform, over which expectation is taken should be realistic over the problem domain.But algorithm books do not certify that the uniform inputs are always realistic.Do the results hold even for non uniform inputs?In this context we observe that Binary Tree sort is more robust than the fast and popular Quick sort in the average case.