Why is F#'s Seq.sortBy much slower than LINQ's IEnumerable.OrderBy extension method?

Question

I\'ve recently written a piece of code to read some data from a file, store it in a tuple and sort all the collected data by the first element of the tuple. After some tests I\'

Answer 1

A difference of x2 is not much when sorts are O(n.log(n)).

Small differences in data structures (e.g. optimising for input being ICollection) could make this scale of difference.

And F# is currently Beta (not so much focus on optimisation vs. getting the language and libraries right), plus the generality of F# functions (supporting partial application etc.) could lead to a slight slow down in calling speed: more than enough to account for the different.