sorting a dictionary by value python

OP Authors 2025

2 min read

·

16-03-2025

24

0

Share

Sorting a Dictionary by Value in Python: A Comprehensive Guide

Dictionaries in Python are unordered collections of key-value pairs. While you can't directly sort a dictionary (because order isn't inherent), you can easily create a sorted representation based on either keys or values. This article focuses on sorting dictionaries by their values. We'll explore several methods, comparing their efficiency and demonstrating their usage with clear examples.

Method 1: Using sorted() with a lambda function

The sorted() function is a powerful tool for sorting iterable objects. By using a lambda function as the key, we can specify that the sorting should be based on the dictionary's values.

my_dict = {'apple': 5, 'banana': 2, 'cherry': 8, 'date': 1}

sorted_dict = dict(sorted(my_dict.items(), key=lambda item: item[1]))

print(sorted_dict)  # Output: {'date': 1, 'banana': 2, 'apple': 5, 'cherry': 8}

This code first uses my_dict.items() to get a list of (key, value) tuples. The lambda item: item[1] function tells sorted() to sort based on the second element of each tuple (the value). Finally, dict() converts the sorted list of tuples back into a dictionary. Note that this creates a new sorted dictionary; the original my_dict remains unchanged.

Method 2: Using operator.itemgetter()

The operator.itemgetter() function provides a more concise and potentially slightly faster alternative to the lambda function.

import operator

my_dict = {'apple': 5, 'banana': 2, 'cherry': 8, 'date': 1}

sorted_dict = dict(sorted(my_dict.items(), key=operator.itemgetter(1)))

print(sorted_dict)  # Output: {'date': 1, 'banana': 2, 'apple': 5, 'cherry': 8}

This code achieves the same result as Method 1, but uses operator.itemgetter(1) to specify that the sorting should be based on the second element of each tuple.

Method 3: Sorting in Descending Order

Both methods can easily be adapted to sort in descending order by adding the reverse=True argument to the sorted() function.

import operator

my_dict = {'apple': 5, 'banana': 2, 'cherry': 8, 'date': 1}

sorted_dict = dict(sorted(my_dict.items(), key=operator.itemgetter(1), reverse=True))

print(sorted_dict)  # Output: {'cherry': 8, 'apple': 5, 'banana': 2, 'date': 1}

Method 4: Handling Dictionaries with Non-Unique Values

If your dictionary contains values that are not unique, the sorting will be arbitrary for those values. The order of these items might change depending on Python's internal implementation. If you need a consistent order for non-unique values, you might consider adding a secondary sorting key, such as the original key itself.

import operator

my_dict = {'apple': 5, 'banana': 2, 'cherry': 8, 'date': 5}

sorted_dict = dict(sorted(my_dict.items(), key=lambda item: (item[1], item[0])))

print(sorted_dict) # Output: {'banana': 2, 'apple': 5, 'date': 5, 'cherry': 8}

This example first sorts by value (item[1]) and then, if values are equal, it sorts by key (item[0]).

Choosing the Right Method

For most cases, either Method 1 (using a lambda function) or Method 2 (using operator.itemgetter()) will suffice. Method 2 is generally considered slightly more efficient, while Method 1 might be more readable for those less familiar with the operator module. Remember to choose the method that best suits your needs and coding style. Consider adding a secondary sorting key if you need consistent ordering for non-unique values. Always keep in mind that these methods return a new sorted dictionary, leaving the original dictionary unchanged.