Fast periodic correction networks

Abstract

We consider the problem of sorting N-element inputs differing from already sorted sequences on t entries. To perform this task we construct a comparator network that is applied periodically. The two constructions for this problem made by previous authors required O(logn + t) iterations of the network. Our construction requires O(log n + (log log N)2(log t)3) iterations which makes it faster for ≫ log N. © Springer-Verlag Berlin Heidelberg 2003.