PriorityQueueArray.c

//Array Queue
# include <stdio.h>
# include <stdlib.h>
# define max 5

int front = 0, rare = 0,data,stack[max], i,j,temp,delete;
int loc = 0,flag=0;
void Enqueue(void);
void Dequeue(void);
void Display(void);
int Full(void);
int Empty(void);
void initialize(void);
void sort(void);
int search(void);

int main()
{
    int ch;
    while(1)
    {
        scanf("%d",&ch);
        switch (ch) {
            case 1:
                Enqueue();
                break;
            case 2:Dequeue();
                break;
            case 3:Display();
                break;
            case 4:initialize();
                break;
            case 5:exit(1);
                break;
                
            default:printf("Invalid option\n");
                break;
        }
    }
    return 0;
}
int Full()
{
    if(rare == max)
        return 1;
    else
        return 0;
}
int Empty()
{
    if(rare == front)
        return 1;
    else
        return 0;
}
void Enqueue()
{
    if(Full())
        printf("Queue is Full\n");
    else
    {
        printf("Enter Queue data\n");
        scanf("%d",&data);
        stack[rare] = data;
        rare++;
        sort();
    }
    
}
void Dequeue()
{
    if(Empty())
        printf("queue is Empty\n");
    else
    {
        if(search() == 1)
        {
            printf("Data %d is Deleted\n",delete);
            for (int i=loc;i<rare;i++)
            {
                stack[i] = stack[i+1];
            }
            rare--;
        }
        else
        {
            printf("Entered element %d not found in the list\n",delete);
        }
    }
}
void Display()
{
    if(Empty())
        printf("Queue is Empty\n");
    else
    {
        for (int i = 0 ; i<rare ; i++)
        {
            printf("%d ",stack[i]);
        }
    }
}
void initialize()
{
    front = rare = 0;
}
void sort()
{
    for (i = 0 ; i< rare-1 ; i++)
    {
        for(j=0;j<rare-i-1;j++)
        {
            if(stack[j] > stack[j+1])
            {
                temp = stack[j];
                stack[j] = stack[j+1];
                stack[j+1] = temp;
            }
        }
    }
}
int search()
{
    
    printf("Enter the element to delete\n");
    scanf("%d",&delete);
    for (i =0 ; i< rare ; i++)
    {
        if(stack[i] == delete)
        {
            flag = 1;
            break;
        }
        loc++;
    }
    if(flag==1)
        return 1;
    else
        return 0;
}