Queue using array

#define MAX 10
int queue[MAX], front=-1, rear=-1;

void enqueue (int num)
{
  if(front == 0 && rear == MAX-1)
    printf("Queue OverFlow Occured");
  
  else if(front == -1 && rear == -1)
  {
      front = rear = 0;
      queue[rear] = num;
  }

  else if(rear == MAX-1 && front != 0)
  {
    rear = 0;
    queue[rear] = num;
  }
  else
  {
      rear++;
      queue[rear] = num;
  }
}

void dequeue()
{
  if(front == -1)
  {
      printf("Underflow");
      return
  }
  int element = queue[front];
  if(front == rear)
     front = rear = -1;
  if(front == MAX-1)
     front = 0;
  else
     front++;
    
   printf("The deleted element is: %d", element);
}

Leave a comment