string Namespace Reference

string manipulation algorithms More...

Functions
template<typename T >
size_t	duval (const T &s)
	Find the lexicographically smallest cyclic shift of a sequence.

Detailed Description

string manipulation algorithms

for std::array for assert for std::size_t for std::deque for std::cout and std::endl for std::string for std::vector

Function Documentation

duval()

template<typename T >

size_t string::duval

(

const T &

s

)

Find the lexicographically smallest cyclic shift of a sequence.

Template Parameters

T	type of the sequence

Parameters

s	the sequence

Returns

the 0-indexed position of the least cyclic shift of the sequence

                         {
    size_t n = s.size();
    size_t i = 0, ans = 0;
    while (i < n) {
        ans = i;
        size_t j = i + 1, k = i;
        while (j < (n + n) && s[j % n] >= s[k % n]) {
            if (s[k % n] < s[j % n]) {
                k = i;
            } else {
                k++;
            }
            j++;
        }
        while (i <= k) {
            i += j - k;
        }
    }
    return ans;
    // returns 0-indexed position of the least cyclic shift
}