Question

I have a list that I want to be able to store 20 values. What would be a good approach to deleting older values. A better example would be, imagine a change history and I wan’t to be able to store 20 latest changes, while older ones go away.

Is there a special thing in C# that will let me do that or do I have to either make my own or use the Remove function.

EDIT1: Alright, how about storing 4000 – 10000 values, suddenly a linked-list looks attractive.

EDIT2: Circular list is good BUT, I don’t want to be able to loop my older values.

EDIT3: For my problem, random access isn’t too important, but sequential access is.

Answer 1

Alright I finally got a chance to think about this problem myself and found a good compromise without going through too much effort. Why not just use a linked list.

1. For a history type of implementation, just keep track of the pointer.
2. It will still be linear time for sequencing operations.
3. Removing the last value can be done in constant time.

I guess I failed to mention that random access wasn’t too important…