Fill, J.A. and Janson, S. (2004) The Number of Bit Comparisons Used by Quicksort: An Average-Case Analysis. ACM-SIAM Symposium on Discrete Algorithms, New Orleans, 11-13 January 2004, 300-307.

has been cited by the following article:

• TITLE: Analysis of the Multi-Pivot Quicksort Process

  AUTHORS: Mahmoud Ragab, Beih El-Sayed El-Desouky, Nora Nader

  KEYWORDS: Quicksort, Convergence, Multi-Pivot Quicksort Process, Stirling Number of the First Kind

  JOURNAL NAME: Open Journal of Modelling and Simulation, Vol.5 No.1, January 12, 2017

  ABSTRACT: In this paper, we study a new version from Dual-pivot Quicksort algorithm when we have some other number of pivots. Hence, we discuss the idea of picking pivots by random way and splitting the list simultaneously according to these. The modified version generalizes these results for multi process. We show that the average number of swaps done by Multi-pivot Quicksort process and we present a special case. Moreover, we obtain a relationship between the average number of swaps of Multi-pivot Quicksort and Stirling numbers of the first kind.