All geek questions in one place

What is the fastest general collection?

I have the following scenario. I have two collections, one of which is missing. What type of collection will be the fastest to find the missing items and insert them?

+3
source share
3 answers

HashSet is your friend: http://msdn.microsoft.com/en-us/library/bb359438.aspx

+5
source

Clone one without elements.

+2
source

You might want to take a look at the HashSet that has the UnionWith method .

+2
source

Source: https://habr.com/ru/post/1760753/

More articles:


All Articles