Is there a performance difference between these two algorithms for shuffling an IEnumerable?

Question

These two questions give similar algorthims for shuffling an IEnumerable:

• C#: Is using Random and OrderBy a good shuffle algorithm?
• Can you enumerate

Answer 1

The second version will probably be a bit slower because of RemoveAt. Lists are really arrays that grow when you add elements to them, and as such, insertion and removal in the middle is slow (in fact, MSDN states that RemoveAt has an O(n) complexity).

Anyway, the best would be to simply use a profiler to compare both methods.