array/Quexetor.cpp
int dequeue(struct Queue* queue){
  if(isEmpty(queue)) return INT_MIN;
  int item = queue->array[queue->front];

  queue->front = (queue->front + 1) % queue->capacity;
  queue->size = queue->size - 1;
  return item;
}
// Function to remove an item from queue.
// It changes front and size

Function to remove an item from queue.
It changes front and size
Function to remove an item from queue . It changes front and size
int dequeue(struct Queue* queue){
  if(isEmpty(queue)) return INT_MIN;
  int item = queue->array[queue->front];
  queue->front = (queue->front + 1) % queue->capacity;
  queue->size = queue->size - 1;
  return item;
}
int dequeue ( struct Queue * queue ) { if ( isEmpty ( queue ) ) return INT_MIN ; int item = queue -> array [ queue -> front ] ; queue -> front = ( queue -> front + 1 ) % queue -> capacity ; queue -> size = queue -> size - 1 ; return item ; }
Function to remove an item from queue.
Function to remove an item from queue .