This C++ code sample shows an array implementation of a queue. Of note is the somewhat novel way that the data is allowed to wrap around the length of the array; if the push index is less than the pop index, the data has wrapped. To handle overlapping, when the number of elements has exceeded the size of the array, the array size is doubled if the new push index is found to equal the pop index after a push operation has been performed. This code was produced as part of a C++ programming course, Data Structures and Algorithms, taken at College of Marin in Fall of 2017.
