Why is List<>.OrderBy LINQ faster than IComparable+List<>.Sort in Debug mode?

Question

I was interested in whether it would be faster to sort my classes using LINQ, or by implementing the IComparable interface and List.Sort. I was quite surprised when the LINQ cod

Answer 1

This could it be the overhead of calling the method CompareTo which would be replaced with an inline when compile and run in release mode.