文章基本信息

标题：Binary Tree Sort is More Robust than Quick Sort in Average Case
本地全文：下载
作者：Soubhik Chakraborty ; Rajarshi Sarkar
期刊名称：International Journal of Computer Science, Engineering and Applications (IJCSEA)
印刷版ISSN：2231-0088
电子版ISSN：2230-9616
出版年度：2012
卷号：2
期号：2
出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：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.
关键词：Binary Tree sort; robustness; expectation; probability distribution; average case complexity