Why implement Queues as Circular Array?
When implementing a FIFO like Queues, my instructor always advise us to represent it as a circular array and not in a regular array. Why? Is it because in the latter, we would end up having garbage data in the array? Simulant If your are using a fixed number of Array-Slots/Elements, it is easier to recycle your slots in a circular arrangement, because you do not need to reorder your Elements. Whenever the first Element gets removed in an Array-Like arrangement, you must move your remaining Elements one position to the front, so the head is not null . In your circular Queue, you just increase