A Detailed Analysis of Quicksort Algorithms with Experimental Mathematics

04/30/2019
by   Yukun Yao, et al.
0

We study several variants of single-pivot and multi-pivot Quicksort algorithms and consider them as discrete probability problems. With experimental mathematics, explicit expressions for expectations, variances and even higher moments of their numbers of comparisons and swaps can be obtained. For some variants, Monte Carlo experiments are performed, the numerical results are demonstrated and the scaled limiting distribution is also discussed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/27/2022

Mathematics and Flamenco: An Unexpected Partnership

In this paper, we present a series of mathematical problems which throw ...
research
11/24/2021

An efficient estimation of nested expectations without conditional sampling

Estimating nested expectations is an important task in computational mat...
research
04/02/2023

Convergence analysis of the Monte Carlo method for random Navier–Stokes–Fourier system

In the present paper we consider the initial data, external force, visco...
research
04/04/2022

The Physicalization of Metamathematics and Its Implications for the Foundations of Mathematics

Both metamathematics and physics are posited to emerge from samplings by...
research
10/29/2021

The divide-and-conquer sequential Monte Carlo algorithm: theoretical properties and limit theorems

We revisit the divide-and-conquer sequential Monte Carlo (DaC-SMC) algor...
research
01/16/2018

A random walk through experimental mathematics

We describe our adventures in creating a new first-year course in Experi...
research
03/13/2020

Experimental Evaluation of a Method to Simplify Expressions

We present a method to simplify expressions in the context of an equatio...

Please sign up or login with your details

Forgot password? Click here to reset