Whats unique about how a circular queue works?

// When the array element with the largest possible index has been used, the next element to join the queue reuses the vacated location at the beginning of the array // Last element is connected to the first element When the last elemental position has been used the queue circles back and uses the first position