DeepAI
Log In Sign Up

Pattern-defeating Quicksort

06/09/2021
by   Orson R. L. Peters, et al.
0

A new solution for the Dutch national flag problem is proposed, requiring no three-way comparisons, which gives quicksort a proper worst-case runtime of O(nk) for inputs with k distinct elements. This is used together with other known and novel techniques to construct a hybrid sort that is never significantly slower than regular quicksort while speeding up drastically for many input distributions.

READ FULL TEXT

page 1

page 2

page 3

page 4

11/02/2018

Worst-Case Efficient Sorting with QuickMergesort

The two most prominent solutions for the sorting problem are Quicksort a...
12/29/2019

Worst-Case Optimal Radix Triejoin

Relatively recently, the field of join processing has been swayed by the...
05/16/2018

Improved Worst-Case Deterministic Parallel Dynamic Minimum Spanning Forest

This paper gives a new deterministic algorithm for the dynamic Minimum S...
11/25/2019

Fast Fibonacci heaps with worst case extensions

We are concentrating on reducing overhead of heaps based on comparisons ...
02/23/2021

Maximizing Agreements for Ranking, Clustering and Hierarchical Clustering via MAX-CUT

In this paper, we study a number of well-known combinatorial optimizatio...