sorted-queue | A sorted queue , based on an array-backed binary heap

public static void sort(Queue queue) {

        if (queue == null || queue.size() < 2) {
            return;
        }
 
        // this is the extra queue
        Queue extraQueue = new ArrayDeque();

        int count = 0;            // count th  

private static void moveMinToRear(Queue queue, int sortIndex) {

        int minElement = Integer.MAX_VALUE;
        boolean flag = false;

        int queueSize = queue.size();
        for (int i = 0; i < queueSize; i++) {

            int curren