i'm thinking hash tables here.
the actual table being a linked list which keeps track of the previous and the next elements.
if the hash table is organized by element #, then u should be able to go into x element and remove it.
same thing with the b part.
__________________
"Luck is what happens when preparation meets opportunity." - Darrel K Royal
|