sais 2.4.1: New formula

An implementation of the induced sorting algorithm

sais is a very simple and small library that provides an
implementation of the induced sorting [1] based suffix array
construction algorithm. The algorithm runs in O(n) worst-case time,
and MAX(2n, 4k) worst-case extra working space, where n and k are the
length of the input string and the number of alphabets.