algorithm for dequeue
Algorithm for Dequeue in C
int dequeue(int queue[], int front, int rear) {
if (*front == -1) {
printf("Queue is empty");
return INT_MIN;
}
int item = queue[*front];
if (front == rear) {
*front = -1;
*rear = -1;
} else {
front = (front + 1) % MAX_SIZE;
}
return item;
}