Queue sort, FIFO

  /*** A queue is a special linear structure that allows for deletion only at the header (head) of the queue, which is called "out of the queue", and is inserted at the tail (tail) of the queues, which is called "enqueued." When there are no elements in the queue (that is, head==tail), called Empty queues, * The Firstin first Out,fifo principle*/     Public Static voidMain (string[] args) {intAa[] =New int[100]; intA[] = {0, 6, 3, 1, 7, 5, 8, 9, 2, 4}, head = 1, tail = 10;  for(intb = 0; b < a.length; b++) {Aa[b]=A[b]; }                 while(Head <tail) {System.out.print (Aa[head]+ " "); Head++; Aa[tail]=Aa[head]; Tail++; Head++; }    }

First put the code out, record a small case

Queue sort, FIFO