Circular Queue

A normal Queue follows FIFO — First In, First Out. Elements are inserted from the rear and removed from the front. But a normal array-based Queue has an interesting problem. Imagine a queue with five