viii Preface reason for this change is that sequential processors have ceased to get
proportional performance improvements from increased circuit complexity. Although the …

We present new sequential and parallel sorting algorithms that now represent the fastest
known techniques for a wide range of input sizes, input distributions, data types, and …

Quicksort is an important algorithm that uses the divide and conquer concept, and it can be
run to solve any problem. The performance of the algorithm can be improved by …

It is well known that Quicksort--which is commonly considered as one of the fastest in-place
sorting algorithms--suffers in an essential way from branch mispredictions. We present a …

Multi-Pivot Quicksort refers to variants of classical quicksort where in the partitioning step k
pivots are used to split the input into k+ 1 segments. For many years, multi-pivot quicksort …

QuickXsort is a highly efficient in-place sequential sorting scheme that mixes Hoare's
Quicksort algorithm with X, where X can be chosen from a wider range of other known …

Sorting a set of items is a task that can be useful by itself or as a building block for more
complex operations. That is why a lot of effort has been put into finding sorting algorithms …

In this paper we generalize the idea of QuickHeapsort leading to the notion of QuickXsort.
Given some external sorting algorithm X, QuickXsort yields an internal sorting algorithm if X …

Since the work of Kaligosi and Sanders (2006), it is well-known that Quicksort--which is
commonly considered as one of the fastest in-place sorting algorithms--suffers in an …

Mergesort is a popular algorithm for sorting real-world workloads as it is immune to data
skewness, suitable for parallelization using vectorized intrinsics, and relatively simple to …