[Adding Circular Queue]

Issue will be closed if:

1) You mention more than one algorithm. You can create a separate issue for each algorithm once the current one is completed.
2) You propose an algorithm that is already present or has been mentioned in a previous issue.
3) You create a new issue without completing your previous issue.

Note: These actions will be taken seriously. Failure to follow the guidelines may result in the immediate closure of your issue.

Name:

[Circular Queue]

About:

A Circular Queue is an extended version of a normal queue where the last element of the queue is connected to the first element of the queue forming a circle.The operations are performed based on FIFO (First In First Out) principle. It is also called ‘Ring Buffer’.Operations on Circular Queue: Front: Get the front item from the queue. Rear: Get the last item from the queue. enQueue(value) This function is used to insert an element into the circular queue. In a circular queue, the new element is always inserted at the rear position. Check whether the queue is full – [i.e., the rear end is in just before the front end in a circular manner]. If it is full then display Queue is full. If the queue is not full then, insert an element at the end of the queue. deQueue() This function is used to delete an element from the circular queue. In a circular queue, the element is always deleted from the front position. Check whether the queue is Empty. If it is empty then display Queue is empty. If the queue is not empty, then get the last element and remove it the queue.

Labels:

new algorithm, gssoc-ext, hacktoberfest, level1

Assignees:

[x] Contributor in GSSoC-ext
[x] Want to work on it
[x] Interested Contributors

AlgoGenesis / C