Document worth reading: “A Detailed Analysis of Quicksort Algorithms with Experimental Mathematics”

We study a quantity of variants of single-pivot and multi-pivot Quicksort algorithms and ponder them as discrete probability points. With experimental arithmetic, particular expressions for expectations, variances and even larger moments of their numbers of comparisons and swaps will probably be obtained. For some variants, Monte Carlo experiments are carried out, the numerical outcomes are demonstrated and the scaled limiting distribution will also be talked about. A Detailed Analysis of Quicksort Algorithms with Experimental Mathematics