Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Evidently LINQ’s “OrderBy” had originally been specified as unstable, but by the time of Orca it was specified as stable. Not all documentation has been updated accordingly – consider these links:
But if LINQ’s OrderBy is now “stable,” then it means it is not using a quicksort (which is inherently unstable) even though some documentation (e.g. Troy’s book) says it is. So my question is: if not quicksort, then what is the actual algorithm LINQ’s orderBy is using?
For LINQ to Objects, it’s a stable quicksort that is used. For any other kind of LINQ, it’s left to the underlying implementation.