\n In this blog post will study why to use circular queue, solution\n to the problem faced by an ordinary queue, operations and C++\n code file for implementation of circular queue.\n
\n\n Consider a situation in oridinary queue where the queue is\n full and you start deleting some items(not completely). Now if\n you want to insert new items then you get an error saying\n queue is full.\n
\n\n But why? It's because we check that if rear index is equal to\n one less than the size of the queue then it's a queue full\n condition. Even though there are rooms at the front which can\n be alotted for more data, due to this one condition there will\n be wastage of memory.\n
\n\n Shift the elements. As and when the dequeue\n operation is performed, we can shift the elements towards\n front such that there will be rooms empty at the rear index\n which can be used to fill. But shifting operation is expensive\n and it's a worst case operation in this solution.\n
\n\n There is an easiar way for implementing the queue that is to\n change the values of front and rear in dequeue and enqueue\n operations respectively by incrementing them by one and taking\n modula with size of the queue(You can clearly understand this\n in code).\n
\n\n In this way, an ordinary queue becomes a circular one. We can\n use a count variable to keep track of no. of items in the\n queue.\n
\n\n In this blog post will study why to use circular queue, solution\n to the problem faced by an ordinary queue, operations and C++\n code file for implementation of circular queue.\n
\n\n Consider a situation in oridinary queue where the queue is\n full and you start deleting some items(not completely). Now if\n you want to insert new items then you get an error saying\n queue is full.\n
\n\n But why? It's because we check that if rear index is equal to\n one less than the size of the queue then it's a queue full\n condition. Even though there are rooms at the front which can\n be alotted for more data, due to this one condition there will\n be wastage of memory.\n
\n\n Shift the elements. As and when the dequeue\n operation is performed, we can shift the elements towards\n front such that there will be rooms empty at the rear index\n which can be used to fill. But shifting operation is expensive\n and it's a worst case operation in this solution.\n
\n\n There is an easiar way for implementing the queue that is to\n change the values of front and rear in dequeue and enqueue\n operations respectively by incrementing them by one and taking\n modula with size of the queue(You can clearly understand this\n in code).\n
\n\n In this way, an ordinary queue becomes a circular one. We can\n use a count variable to keep track of no. of items in the\n queue.\n
\n