使用Java对队列进行快速排序

import java.util.LinkedList;
import java.util.Queue;

public class QueueQuickSort {
    public static void quickSort(Queue<Integer> queue) {
        if (queue.size() <= 1) {
            return;
        }
        
        int pivot = queue.poll();
        Queue<Integer> smaller = new LinkedList<>();
        Queue<Integer> larger = new LinkedList<>();
        
        while (!queue.isEmpty()) {
            int element = queue.poll();
            if (element <= pivot) {
                smaller.offer(element);
            } else {
                larger.offer(element);
            }
        }
        
        quickSort(smaller);
        quickSort(larger);
        
        queue.addAll(smaller);
        queue.offer(pivot);
        queue.addAll(larger);
    }
    
    public static void main(String[] args) {
        Queue<Integer> queue = new LinkedList<>();
        queue.offer(5);
        queue.offer(3);
        queue.offer(8);
        queue.offer(2);
        queue.offer(1);
        
        quickSort(queue);
        
        while (!queue.isEmpty()) {
            System.out.print(queue.poll() + " ");
        }
    }
}