큐(Queue)

■ 큐의 배열 구현

[ enqueue 함수 ]

unsigned int succ(unsigned int value, QUEUE Q)
{
    if(++value == Q->q_capacity)
        value=0;
    return value;
}

void enqueue(int x, QUEUE Q)
{
    if(is_full(Q))
        error("Full queue");
    else
    {
        Q->q_size++;
        Q->q_rear=succ(Q->q_rear,Q);
        Q->q_array[Q->q_rear]=x;
    }
}