6 Ways to Code Circular Buffers

In this video, we explore 6 different approaches to creating Circular Buffers, exploring solutions in C#, Python, Crystal, C++, Elm and Erlang. We explore queues, static and dynamic arrays, immutable data structures and a fun agent based implementation.

Circular Buffers are First In, First Out (FIFO) queues that are a fixed size. They're usually backed by an array, which gives it great spatial/data locality (good for performance!)

Kick back and enjoy 50mins of learning with Jeremy and Erik, then go solve the exercise in your favourite way on Exercism.

Solve the exercise at: https://exercism.org/exercises/circul...
Join #48in24 at: https://exercism.org/challenges/48in24

C# Reference: https://github.com/microsoft/referenc...

Featured Solutions:
https://exercism.org/tracks/csharp/ex...
https://exercism.org/tracks/python/ex...
https://exercism.org/tracks/crystal/e...
https://exercism.org/tracks/cpp/exerc...
https://exercism.org/tracks/elm/exerc...
https://exercism.org/tracks/erlang/ex...

Timestamps:
00:00:00 Introduction
00:07:27 C#: derive from a Queue
00:12:23 Python: dynamic array
00:18:32 Elm: immutable data structure
00:25:50 Crystal: use static array with read and write index
00:35:58 C++: use static array with read and size
00:38:12 Erlang: genserver (agents)
00:47:08 Conclusion