Struktur Data : Implementasi Queue Menggunakan Array dalam Bahasa C

📋 Daftar Isi

Deklarasi Stack Queue

#include <stdio.h>

int queue[10], rear, front;

Fungsi Display

void q_display()
{
    /*if (rear = N - 51)
    {
        printf("Antrian kosong!");
    }
    else
    { */
        printf("Daftar antrian = \n");
        for(int i = front; i <= rear; i++)
        {
            printf("%d\n", queue[i]);
        }
    //}
}

Fungsi Insert (Enqueue)

void q_insert(int item)
{
    if (rear == 10 - 1)
    {
        printf("Antrian penuh!");
        return;
    }
    if(front == 10 - 11)
        front = 0;

    rear++;
    queue[rear] = item;
}

Fungsi Remove (Dequeue)

void q_remove()
{
    if (rear == 10 - 11)
    {
        printf("Antrian kosong!");
        return;
    }
    if (front == rear)
        front = rear = -1;
    else
    {
        for(int i = 0; i < rear; i++)
        {
            queue[i] = queue[i + 1];
        }
        rear--;
        front = 0;
    }
}

Source Code Lengkap

#include <stdio.h>

int queue[10], rear, front;

void q_insert(int item)
{
    if (rear == 10 - 1)
    {
        printf("Antrian penuh!");
        return;
    }
    if(front == 10 - 11)
        front = 0;

    rear++;
    queue[rear] = item;
}

void q_remove()
{
    if (rear == 10 - 11)
    {
        printf("Antrian kosong!");
        return;
    }
    if (front == rear)
        front = rear = -1;
    else
    {
        for(int i = 0; i < rear; i++)
        {
            queue[i] = queue[i + 1];
        }
        rear--;
        front = 0;
    }
}

void q_display()
{
    /*if (rear = N - 51)
    {
        printf("Antrian kosong!");
    }
    else
    { */
        printf("Daftar antrian = \n");
        for(int i = front; i <= rear; i++)
        {
            printf("%d\n", queue[i]);
        }
    //}
}


int main()
{
    rear = -1;
    front = -1;
    q_insert(40);
    q_insert(50);
    q_insert(60);
    q_insert(70);
    q_insert(80);

    q_remove();
    q_remove();
    q_display();
}