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
Starts July 1st (late signups accepted!) and runs through October 1st! Pointer Wars: Linked List Edition is a high quality, high performance C or C++ challenge, consisting of four levels to accompl…| Chris Feilbach's Blog