New simple and fast quicksort algorithm for equal keys

TL;DR

This paper presents 'eqsort', a new quicksort variant optimized for datasets with many duplicate keys, demonstrating competitive performance and potential advantages over existing methods.

Contribution

Introduces 'eqsort', a novel quicksort partitioning technique tailored for duplicate-rich data, outperforming current state-of-the-art algorithms.

Findings

eqsort is competitive with leading quicksort implementations

eqsort offers advantages over dual-pivot and pdqsort methods

Experimental results show eqsort's efficiency on real-world data

Abstract

This paper introduces a novel and efficient partitioning technique for quicksort, specifically designed for real-world data with duplicate elements (50-year-old problem). The method is referred to as "equal quicksort" or "eqsort". Based on the experimental findings, it has been determined that the newly developed algorithm, eqsort, is competitive with the best current implementations,such as fat partitioning algorithms and dual-pivot quicksort. This method offers several advantages over the commonly used dual-pivot method and pdqsort partitioning, making it a potential replacement.