CODEWITHSUNDEEP
c#.netperformancelinq
Jonny
Jonny

Reputation: 2927

Linq ToList/ToArray/ToDictionary performance

Well I encounter many situations where having an IEnumerable is not enough. However I'm unsure about the performance of the above method calls.

What I really want to ask is:

Is the performance of ToList/ToArray:

  1. an O(n) operation which copies the IEnumerable to a new array/List ?

  2. If I called a linq extention method on a list, it has an O(1) performance if I call ToList but O(n) if call ToArray (and the opposite if my original list was an array) ?

  3. Some magic happens and the performance is O(1)?

Probably to Dictionary is O(n), right ?

Upvotes: 25

Views: 19085

Answers (1)

Jon Skeet
Jon Skeet

Reputation: 1500585

Is the performance of ToList/ToArray an O(n) operation which copies the IEnumerable to a new array/List ?

Yes. ToList is slightly more efficient, as it doesn't need to trim the internal buffer to the right length first.

If I called a linq extention method on a list, it has an O(1) performance if I call ToList but O(n) if call ToArray (and the opposite if my original list was an array) ?

No. For both calls, a new collection is always created; that's a shallow copy of the original collection. It's more efficient to call ToList or ToArray on any ICollection<T> than on a simple IEnumerable<T> which doesn't implement ICollection<T> though, as with a collection the length is known to start with. (This is detected at execution time though; you don't need to worry about the compile-time type.)

Probably to Dictionary is O(n), right ?

Assuming the hash is sensible, it's O(N), yes. Basically it creates a new dictionary in exactly the way you'd probably expect it to.

You might want to read the corresponding posts in my Edulinq blog series:

Upvotes: 51

Related Questions