ya i also have thot on the same lines
and when the fixed malloc block is full with data we can realloc()
any better idea..??
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@google
how about having a fixed size of malloced block which is split into the
required size of nodes and used this memory for linked list, in this case
each two nodes are not far ?.
Does it help ?.
Thanks,
Sathaiah
On Wed, Feb 17, 2010 at 6:12 PM, banu wrote:
> Hi,
> I had been thinking about this p
Hi,
I had been thinking about this problem from quite sometime. Linked
lists are good dynamic data structures and solve the main problems
associated with arrays(static memory allocation)
On the other hand, one of the biggest disadvantages of linked lists is
that their cache utilization is extremel
