About this document
ArrayQueue: Efficient FIFO Implementation by Sergey Shamirian is a document available to read on EtoBox.
This document describes the ArrayQueue data structure, which implements a FIFO queue using a circular array. It supports adding and removing elements in O(1) time per operation by using modular arithmetic to treat the array as circular. Resizing the array is also supported in O(n) time to ensure the number of elements doesn
- Author
- Sergey Shamirian
- Language
- EN