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 …

We explain the counterintuitive observation that finding “good” pivots (close to the median of
the array to be partitioned) may not improve performance of quicksort. Indeed, an …

In quicksort, due to branch mispredictions, a skewed pivot-selection strategy can lead to a
better performance than the exact-median pivot-selection strategy, even if the exact median …

Quicksort was first introduced in 1961 by Hoare. Many variants have been developed, the
best of which are among the fastest generic-sorting algorithms available, as testified by the …

The analysis of algorithms mostly relies on counting classic elementary operations like
additions, multiplications, comparisons, swaps etc. This approach is often sufficient to …

Sorting is one of the most important and well-studied problems in computer science. Many
good algorithms are known which offer various trade-offs in efficiency, simplicity, memory …

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 …

According to a folk theorem, every program can be transformed into a program that produces
the same output and only has one loop. We generalize this to a form where the resulting …

It is well-known that to minimize the number of comparisons a binary search tree should be
perfectly balanced. Previous work has shown that a dominating factor over the running time …