Solve real coding problems
Articles about sorting collections of items with C#.
When you need to sort a list, you don’t need to reinvent the wheel. You can use one of these three built-in methods for sorting a list: In this article, I’ll show examples of using these three approaches for sorting a list. Sort a list with OrderBy() (Linq) The OrderBy() Linq method generates an IOrderedEnumerable … Read more
Dictionaries are unordered data structures. Key/value pairs aren’t stored in sorted order. When you want the Dictionary in sorted order, there are two simple options: I’ll show both options. Sort Dictionary with OrderBy() Use OrderBy() (from System.Linq) to sort the Dictionary by key or value. It returns the Dictionary’s KeyValuePairs in ascending sorted order. I’ll … Read more
To sort a list, except for the first element, you need to: This can be accomplished in a single line using Linq methods: Example – sorting a list of people Let’s say we have a list of people, such as the following: Here’s how to sort the people by first name, except for the first … Read more
Use the OrderBy() and ThenBy() Linq methods when you want to sort by multiple fields, like this: Ascending vs Descending order By default, OrderBy() and ThenBy() sort in ascending order. If you want to sort by descending order, use the Descending version of each method. For example, if I want to sort NFL teams within … Read more
One day I decided to challenge myself by trying to implement multithreaded quicksort. I wanted to see how it would compare to the built-in sort function – Array.Sort(). I came up with two algorithms that were 2-4x faster than Array.Sort(): After continuing to tinker, in attempts to further optimize, I came across PLINQ.AsParallel().OrderBy(). After reading … Read more
