Dynamic memory allocation isn’t free. Today I discuss a means of reducing the frequency of it for a breadth first search algorithm. This is part of an ongoing series of posts relating to the high performance C programming challenge Pointer Wars. Come join us! The Pointer Wars challenge has four levels to it. Level 2 […]| Chris Feilbach's Blog