DeepAI AI Chat
Log In Sign Up

Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data

by   Juan Jose Besa, et al.
University of California, Irvine

We empirically study sorting in the evolving data model. In this model, a sorting algorithm maintains an approximation to the sorted order of a list of data items while simultaneously, with each comparison made by the algorithm, an adversary randomly swaps the order of adjacent items in the true sorted order. Previous work studies only two versions of quicksort, and has a gap between the lower bound of Omega(n) and the best upper bound of O(n log log n). The experiments we perform in this paper provide empirical evidence that some quadratic-time algorithms such as insertion sort and bubble sort are asymptotically optimal for any constant rate of random swaps. In fact, these algorithms perform as well as or better than algorithms such as quicksort that are more efficient in the traditional algorithm analysis model.


page 1

page 2

page 3

page 4


Optimally Sorting Evolving Data

We give optimal sorting algorithms in the evolving data framework, where...

Efficient Algorithms for Sorting in Trees

Sorting is a foundational problem in computer science that is typically ...

Online List Labeling: Breaking the log^2n Barrier

The online list labeling problem is an algorithmic primitive with a larg...

The Log-Interleave Bound: Towards the Unification of Sorting and the BST Model

We study the connections between sorting and the binary search tree mode...

Data Oblivious Algorithms for Multicores

As secure processors such as Intel SGX (with hyperthreading) become wide...

Optimal Physical Sorting of Mobile Agents

Given a collection of red and blue mobile agents located on two grid row...

Sorting Short Keys in Circuits of Size o(n log n)

We consider the classical problem of sorting an input array containing n...