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.
Hey, I have been trying to find an answer (both on stackoverflow and google) to the question how Array.Sort in C# is so fast.
I didn’t find one.
No matters which algorithm I used I didn’t manage to sort big arrays faster than it.
I know it uses Quick Sort, but it must be very optimized.
Does anybody know how did they make it so fast?
You could use ILSpy to disassemble the code. I would expect native methods in the inner sorting code to speed up things.