Skip to content
#

data-structure-and-algorithm

Here is 1 public repository matching this topic...

The Circle Queue implementation in Go. The circle queue is a special version of a 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'.

  • Updated Nov 10, 2022
  • Go

Improve this page

Add a description, image, and links to the data-structure-and-algorithm topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the data-structure-and-algorithm topic, visit your repo's landing page and select "manage topics."

Learn more