Sorting a Dictionary by Value in C#: A Complete Guide with Examples

Why Sorting a Dictionary by Value is a Headache (and How to Fix It)

Have you ever encountered a situation: you have a Dictionary<string, int> with dozens of entries, and you need to display them in descending order of popularity? For example, a list of the most frequent words in a text or the top 10 products by sales. It seems like a simple task, but the standard Dictionary in C# stores data in an arbitrary order. On Stack Overflow, the question "How do you sort a dictionary by value?" has garnered thousands of views — and for good reason.

In this tutorial, we'll cover all legitimate ways to sort a Dictionary by value in C#: from a simple LINQ hack to creating your own ordered dictionary. You'll learn which method to choose for maximum performance and code readability.

Why Doesn't Dictionary Sort Itself?

Before diving into the code, let's understand the nature of Dictionary<TKey, TValue>. This data type is a hash table. It is optimized for fast key lookup, not for storing elements in a specific order. When you add an element, it goes into a "bucket" based on the key's hash. No sorting occurs.

If you need sorted output — you'll have to intervene manually. The good news: C# provides several elegant solutions.

Method 1: LINQ — The Most Popular Approach (Like the Answer on Stack Overflow)

The simplest and most commonly used approach is to use LINQ with the OrderBy or OrderByDescending method. This option is ideal when you need to sort data once for display or export.

using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nvar fruits = new Dictionary<string, int>\n{\n    {"apple", 5},\n    {"banana", 3},\n    {"orange", 8},\n    {"grape", 1}\n};\n\n// Sort by value ascending\nvar sortedAsc = fruits.OrderBy(pair => pair.Value);\n\n// Sort by value descending\nvar sortedDesc = fruits.OrderByDescending(pair => pair.Value);\n\nConsole.WriteLine("Ascending:");\nforeach (var item in sortedAsc)\n{\n    Console.WriteLine($"{item.Key}: {item.Value}");\n}\n\nConsole.WriteLine("\\nDescending:");\nforeach (var item in sortedDesc)\n{\n    Console.WriteLine($"{item.Key}: {item.Value}");\n}

Result:

Ascending:\ngrape: 1\nbanana: 3\napple: 5\norange: 8\n\nDescending:\norange: 8\napple: 5\nbanana: 3\ngrape: 1

How Does It Work?

OrderBy returns an IOrderedEnumerable<KeyValuePair<string, int>> — a sequence that is sorted "lazily" (only upon first iteration). This is not a new dictionary, but a projection. If you need to save the result, convert it back to a dictionary using .ToDictionary().

Important: ToDictionary creates a regular Dictionary, which again does not guarantee order. If order is critical — use SortedDictionary or a list of tuples.

Method 2: SortedDictionary — When Order is Needed Constantly

If you plan to access sorted data multiple times, it's better to use SortedDictionary. This class automatically maintains sorting by key. But we need sorting by value!

The trick: we cannot make SortedDictionary sort by value directly. But we can use SortedDictionary with a custom comparer or, more simply, create a helper class.

using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nvar fruits = new Dictionary<string, int>\n{\n    {"apple", 5},\n    {"banana", 3},\n    {"orange", 8},\n    {"grape"