Algorithm

Printer.js

function solution(priorities, location){
    var answer = 1;
    var first = -1;
    var requestIdx = location;

    while(priorities.length > 0){
        first = priorities.shift();

        if(priorities.some((value, index) => value > first)){
            priorities.push(first);
        }
        else{
            if(requestIdx == 0){
                break;
            }
            else{
                answer++;
            }
        }
        if(requestIdx == 0){
            requestIdx = priorities.length - 1;
        }
        else{
            requestIdx--;
        }
    }
    return answer;
}