Space Efficient Construction of Lyndon Arrays in Linear Time

11/08/2019

∙

by   Philip Bille, et al.

∙

0

∙

share

We present the first linear time algorithm to construct the 2n-bit version of the Lyndon array using only o(n) bits of working space. A simpler variant of this algorithm computes the plain (n n-bit) version of the Lyndon array using only O(1) words of additional working space. All previous algorithms are either not linear, or use at least n n bits of additional working space. Also in practice, our new algorithms outperform the previous best ones by an order of magnitude, both in terms of time and space.