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.
There’s a few questions discussing Merge sorting a LinkedList, but how can I do it with the C# LinkedList?
Since the LinkedListNode Next and Previous properties are read-only most of the in-place algorithms I’ve come across are not possible.
I’ve resorted to removing all the nodes, sorting them with a .OrderBy(node => node.Value) and then re-inserting them into the Linked list, but it’s fairly crude.
You can re-order nodes by calling
Remove, thenAddAfter.