use (dynamic/ infinite)array initial the array with -1.
insert(int a)
{
array[a]=a;
}
delete(int a)
{
array[a]=-1;
}
......
Thank you,
SiddharamOn Thu, Aug 18, 2011 at 7:54 PM, DheerajSharma <[email protected]>wrote: > bitset would work i guess > > On Aug 18, 7:10 pm, hary rathor <[email protected]> wrote: > > bitset is best . require only 32 time less then require in hash table . > > -- > 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. > > -- 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.
