cache¶

Estimated time to read: 1 minute

1/29/24
in algorithms, data structures, c++, optimization, memory
9 min read

Differences between map vs unordered_map

Both std::map and std::unordered_map are associative containers that store key-value pairs, let's have a deep dive into the differences between them.

10/2/23
in maze, data structures, c++, optimization, memory
13 min read

Memory-efficient Data Structure for Procedural Maze Generation

In this post, you will learn how to create a memory-efficient data structure for maze generation. We will jump from a 320 bits data structure to just 2! It is achieved by taking a bunch of clever decisions, changing the referential and doing some math. Be warned, this not for the fainted hearts. Are you brave enough?