If you don't want LINQ, then you compare on the first field and store that value. If they are equal (zero is returned) then you compare on the second field, and so on...
Main Topics
Browse All TopicsI need to sort a generic list with multiple keys ... for example, I want to sort a list of person objects by Age within Department.
I can sort the list to Age OK but when I then re-sort this sorted list by Department the Age sequence is destroyed.
Is there a way to preserve the sub-order?
This Question has been solved and asker verified All Experts Exchange premium technology solutions are available to subscription members.
Experts Exchange has been collecting answers to technology questions since 1996…3 million and counting! If you have a question, chances are we already have your answer.
If you can't find the exact answer you're looking for, ask our exclusive community of 50,000 experts. You’ll get a personalized answer from a trusted professional.
Thousands of free tech tips, tricks, how-to’s and tutorials are available in our peer reviewed articles section. See for yourself how smart our experts are, no login required.
Access the answers to your technology questions today.
30-day free trial. Register in 60 seconds.
Members of the expert community talk about why the experience at Experts Exchange is different than what you will find anywhere else.

Try it out and discover for yourself.
30-day free trial. Register in 60 seconds.
Join the community of experts here and help other tech pros by answering question in your area of expertise. You can earn FREE access to all Experts Exchange's premium features and resources.
Business Accounts
Answer for Membership
by: CraigWagnerPosted on 2009-11-02 at 11:27:07ID: 25722741
Using LINQ is probably the easiest solution. I usually program in C#, so the code snippet may need work. It compiles, but I didn't run it to be sure.
Select allOpen in new window