1. Kruse, R., Tondo, C.L., Leung, B.: Data Structures & Program Design in C. PHI, 2nd edn., p. 318
2. Sourabh, S.K., Chakraborty, S.: How robust is quicksort average complexity? arXiv:0811.4376v1 [cs.DS]. Advances in Mathematical Sciences Journal (to appear)
3. Chakraborty, S., Sourabh, S.K.: A Computer Experiment Oriented Approach to Algorithmic Complexity. Lambert Academic Publishing (2010)
4. Sourabh, S.K., Chakraborty, S.: Empirical Study on the Robustness of Average Complexity & Parameterized Complexity Measure for Heapsort Algorithm. International Journal of Computational Cognition 7(4) (December 2009)
5. Floyd, R.W.: Algorithms 245 (TREESORT). Communications of the ACM 7, 701 (1964)