use a linked list where each node points to a queue On 20 June 2010 15:13, sharad <[email protected]> wrote:
> Give a good data structure for having n queues ( n not fixed) in a > finite memory segment. You can have some data-structure separate for > each queue. Try to use at least 90% of the memory space. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
