Correction to: A Practical, Provably Linear Time, In-place and Stable Merge Algorithm via the Perfect Shuffle

04/04/2020
by   John Ellis, et al.
0

We correct a paper previously submitted to CoRR. That paper claimed that the algorithm there described was provably of linear time complexity in the average case. The alleged proof of that statement contained an error, being based on an invalid assumption, and is invalid. In this paper we present both experimental and analytical evidence that the time complexity is of order N^2 in the average case, where N is the total length of the merged sequences.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/09/2017

A linear-time algorithm for the maximum-area inscribed triangle in a convex polygon

Given the n vertices of a convex polygon in cyclic order, can the triang...
research
02/19/2023

Synchronizing Many Filesystems in Near Linear Time

Finding a provably correct subquadratic synchronization algorithm for ma...
research
05/26/2021

Boltzmann sampling of irreducible context-free structures in linear time

We continue our program of improving the complexity of so-called Boltzma...
research
07/14/2023

Computing Zigzag Vineyard Efficiently Including Expansions and Contractions

Vines and vineyard connecting a stack of persistence diagrams have been ...
research
11/15/2022

Resilient Set-based State Estimation for Linear Time-Invariant Systems Using Zonotopes

This paper considers the problem of set-based state estimation for linea...
research
09/20/2022

Efficient Model Based Diagnosis

In this paper an efficient model based diagnostic process is described f...
research
03/22/2015

Construction of FuzzyFind Dictionary using Golay Coding Transformation for Searching Applications

Searching through a large volume of data is very critical for companies,...

Please sign up or login with your details

Forgot password? Click here to reset