Javascript Program to FInd Lexicographically smallest rotated sequence | Set 2

// Javascript program to find lexicographically
// smallest sequence with rotations.

// Function to compare lexicographically
// two sequence with different starting
// indexes. It returns true if sequence
// beginning with y is lexicographically
// greater.
function compareSeq(S, x, y, n) {
    for (let i = 0; i < n; i++) {
        if (S[x] < S[y])
            return false;
        else if (S[x] > S[y])
            return true;
        x = (x + 1) % n;
        y = (y + 1) % n;
    }
    return true;
}

// Function to find starting index
// of lexicographically smallest sequence
function smallestSequence(S, n) {
    let index = 0;
    for (let i = 1; i < n; i++)

        // if new sequence is smaller
        if (compareSeq(S, index, i, n))

            // change index of current min
            index = i;

    return index;
}

// Function to print lexicographically
// smallest sequence
function printSmallestSequence(str, n) {
    let S = str.split("");
    let starting_index = smallestSequence(S, n);
    for (let i = 0; i < n; i++)
        console.log(S[(starting_index + i) % n]);
}

// driver code
let S = "DCACBCAA";
let n = 8;
printSmallestSequence(S, n);