How do I implement best fit algorithm for memory management in C?
My approach was to put free blocks into linked lists, where all the blocks in each list had the same size. The list themselves where organized into an AVL tree, with the size of the blocks in the list being the lookup key. Heap Memory Manager