|Double linked list?
||[Nov. 17th, 2009|05:28 am]
What's the best algorithm for finding free elements in the memory allocated for a double linked list? I thought briefly last night about it, and came up with an inversed linked list - one that contains free elements - weaved between the actual linked list.|
When new elements are needed two sets of pointers are modified, those of the list, adding the free element to it, and the pointers of the free-space list, removing the element from it.
Is there a faster way to find free space in a linked list memory block?