%0 Journal Article %1 noauthororeditor %A Chakraborty, Soubhik %D 2012 %J International Journal of Computer Science, Engineering and Applications (IJCSEA) %K algorithms networks %N 02 %P 115-123 %R 10.5121/ijcsea.2012.2209 %T BINARY TREE SORT IS MORE ROBUST THAN QUICK SORT IN AVERAGE CASE %U http://airccse.org/journal/ijcsea/papers/2212ijcsea09.pdf %V 02 %X 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 fastand popular Quick sort in the average case.

@article{noauthororeditor, abstract = {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 fastand popular Quick sort in the average case.}, added-at = {2018-07-17T13:38:20.000+0200}, author = {Chakraborty, Soubhik}, biburl = {https://www.bibsonomy.org/bibtex/2f66b82adc790cf7d1427760ea4eaac4a/ijcsea}, doi = {10.5121/ijcsea.2012.2209}, interhash = {0fb6fa63988da560f528f0d73ddf138b}, intrahash = {f66b82adc790cf7d1427760ea4eaac4a}, issn = {2230 - 9616}, journal = {International Journal of Computer Science, Engineering and Applications (IJCSEA)}, keywords = {algorithms networks}, month = {April}, number = 02, pages = {115-123}, timestamp = {2018-07-17T13:38:20.000+0200}, title = {BINARY TREE SORT IS MORE ROBUST THAN QUICK SORT IN AVERAGE CASE}, url = {http://airccse.org/journal/ijcsea/papers/2212ijcsea09.pdf}, volume = 02, year = 2012 }