c# - which is collection or list is fastest for too many additions & deletions? -


I have a list with a large number of elements added & amp; Removed every other
I have to search the elements in the list at the same time.

In addition to this, I need to find the key / value pair comparison.

Extra rate is more than delete

Thanks in advance.

Try it

Extra, extinction and lookup are too much (1). I'm not sure what you call "search for the key / price comparison", but searching the dictionary map keys in values ​​more quickly.

If you actually list (i.e., an order on the elements), then you will be better served.


Comments

Popular posts from this blog

c# - How to capture HTTP packet with SharpPcap -

php - Multiple Select with Explode: only returns the word "Array" -

php - jQuery AJAX Post not working -