IIIT Hyderabad Publications
Revisiting Calculation of Moments of Number of Comparisons used by the Randomized Quick Sort Algorithm
Authors: Sumit Kumar Jha
Journal: Discrete Mathematics, Algorithms and Applications (link)
Report no: IIIT/TR/2016/24
We revisit the method of Kirschenhofer, Prodinger and Tichy to calculate the moments of comparisons used by the randomized quick sort algorithm. We reemphasize that this approach helps in calculating these quantities with less computation. We also point out that as observed by Knuth this method also gives moments for total path length of a binary search tree built over a random set of n keys.
Full article: pdf
Centre for Security, Theory and Algorithms
Copyright © 2009 - IIIT Hyderabad. All Rights Reserved.