Click here to Skip to main content
15,908,112 members
Articles / General Programming / Optimization

Snake Two Ways: Exploring Circular Arrays and Queuing

Rate me:
Please Sign up or sign in to vote.
5.00/5 (3 votes)
7 Mar 2024CPOL4 min read 5.2K   63   8  
A "new" queue data structure is described and compared with existing collection types
This article documents the creation of a collection data type. The performance of this data type is compared with off-the-shelf .NET and C++ data types, and conclusions are made.


Daily Counts


Weekly Counts


This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Written By
Software Developer
United States United States
Michael Balloni is a manager of software development at a cybersecurity software and services provider.

Check out for all the programming fun he's done over the years.

He has been developing software since 1994, back when Mosaic was the web browser of choice. IE 4.0 changed the world, and Michael rode that wave for five years at a .com that was a cloud storage system before the term "cloud" meant anything. He moved on to a medical imaging gig for seven years, working up and down the architecture of a million-lines-code C++ system.

Michael has been at his current cybersecurity gig since then, making his way into management. He still loves to code, so he sneaks in as much as he can at work and at home.

Comments and Discussions