Sort Dictionary by Value Python

How to Sort Data with the sorted() Method

Python's sorted() function is a versatile tool, offering a straightforward approach to sorting various data types, including lists, tuples, and, importantly for us, dictionary values. This function returns a new sorted list from the items in any iterable, not just dictionaries, making it incredibly useful across a wide range of scenarios.

To sort a dictionary by its values using the sorted() method, you typically pair it with a lambda function or a custom function that specifies the dictionary values as the sorting criteria. This combination allows for both ascending and descending sorts, giving you the flexibility to tailor the output to your specific needs.

Here's a basic example to illustrate sorting a dictionary by its values in ascending order:

• Python

Python

# Sample dictionary

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

# Sorting dictionary by value

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

# Convert to dictionary

sorted_dict = dict(sorted_items)

print(sorted_dict)

You can also try this code with Online Python Compiler

Run Code

Output

This code snippet first converts the dictionary items to a list of tuples using the .items() method, sorts them by the second element of each tuple (the value) using a lambda function, and then converts the sorted list of tuples back into a dictionary.

How the sorted() Method Works

The sorted() function in Python operates by taking an iterable as its input and returning a new list with the elements arranged in a specified order. The beauty of sorted() lies in its flexibility; it can sort various data types and allows for custom sorting logic through its parameters.

At its core, sorted() works by comparing the elements in the iterable against each other. When sorting dictionaries by value, the function evaluates the dictionary's values during these comparisons. The sorting algorithm behind sorted() is TimSort, a hybrid sorting algorithm derived from merge sort and insertion sort, known for its efficiency in handling real-world data.

Here's a breakdown of the process when sorting dictionary values:

Conversion to Iterable

The dictionary is converted into an iterable of key-value pairs (tuples), typically using the .items() method.

Specification of Sorting Key

 A key function is specified, often through a lambda function, that tells sorted() to use the dictionary's values (the second element of each tuple) as the basis for sorting.

Sorting Process

The TimSort algorithm kicks in, rearranging the key-value pairs based on the values, while ensuring stability (i.e., elements with equal keys retain their original order).

Creation of Sorted List

The sorted key-value pairs are compiled into a list, maintaining the new order.

This process results in a list of tuples representing the dictionary's key-value pairs, sorted according to the values. To convert this list back into a dictionary, you can use the dict() constructor, as seen in previous examples.

Parameters of the sorted() Method

The sorted() function is equipped with several parameters that allow for extensive customization of the sorting process. These parameters enable you to define not just the sorting criteria but also the order and even handle complex data structures with ease. Let's dive into the key parameters:

Iterable

The primary input for sorted() is the iterable to be sorted, which can be anything from a list to a tuple, or the items of a dictionary.

Key

This parameter accepts a function that serves as a key for the sort comparison. For dictionaries, this is where you can use a lambda function to specify that the values should be used for sorting. For example, key=lambda item: item[1] tells Python to sort based on the second item of each tuple (which represents the value in a dictionary's key-value pair).

Reverse

By setting the reverse parameter to True, you can sort the items in descending order instead of the default ascending order. This is particularly useful when you need to order items from highest to lowest, such as in a leaderboard.

Here's an example that uses these parameters to sort a dictionary by its values in descending order:

• Python

Python

# Sample dictionary

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

# Sorting dictionary by value in descending order

sorted_items = sorted(my_dict.items(), key=lambda item: item[1], reverse=True)

# Convert to dictionary

sorted_dict = dict(sorted_items)

print(sorted_dict)

You can also try this code with Online Python Compiler

Run Code

Output

In this example, sorted() takes my_dict.items() as the iterable, uses a lambda function to sort by the dictionary's values, and applies reverse=True to sort in descending order. The sorted list of tuples is then converted back into a dictionary.

How to Sort a Dictionary with the sorted() Method

Sorting a dictionary by its values in Python can be achieved seamlessly using the sorted() method, combined with a little help from lambda functions or custom sorting functions. This approach not only sorts the dictionary but also offers the flexibility to customize the sorting order and criteria according to your specific needs. Let's walk through the steps and see some code in action.

Step-by-Step Process

Extract Key-Value Pairs

Convert the dictionary into a list of tuples (key-value pairs) using the .items() method. This allows the sorted() function to access the dictionary's values.

Apply the sorted() Method

Use sorted() to sort these key-value pairs. The key parameter is crucial here, as it determines the basis for sorting. A lambda function is commonly used to specify that the dictionary values should be the sorting criterion.

Sorting Order

Decide on the sorting order (ascending or descending). By default, sorted() sorts in ascending order. To sort in descending order, set the reverse parameter to True.

Reconstruct the Dictionary

The sorted() method returns a sorted list of tuples. Use the dict() function to convert this list back into a dictionary.

Example Code

• Python

Python

# Original dictionary

scores = {'Alice': 88, 'Bob': 75, 'Charlie': 93, 'Diana': 85}

# Sort the dictionary by value

sorted_scores = sorted(scores.items(), key=lambda x: x[1])

# Convert the sorted list of tuples back into a dictionary

sorted_scores_dict = dict(sorted_scores)

print("Sorted Dictionary:", sorted_scores_dict)

You can also try this code with Online Python Compiler

Run Code

Output

In this example, scores.items() is passed to the sorted() function, which sorts the items based on their values (x[1] in the lambda function). The result is a list of tuples sorted by the dictionary's values, which is then converted back into a dictionary.

Sorting Dictionary By Value

When it comes to organizing data in Python, especially for tasks that require a specific order, sorting dictionaries by their values becomes a critical operation. This technique is not just about achieving an ordered sequence but also about enhancing data readability, optimizing algorithms, and preparing data for further processing like visualization or statistical analysis.

Advanced Sorting Techniques

Sorting by Multiple Criteria: Python's sorted() method is incredibly flexible, allowing sorting by multiple criteria. For instance, you might first sort a dictionary by value, then by key to resolve ties. This is achieved by extending the key function.

Custom Sorting Logic

Beyond simple ascending or descending sorts, Python allows for custom sorting logic through the key function. This can include complex operations like sorting based on the length of strings, the sum of tuple elements, or any user-defined metric.

Handling Complex Data Structures

When dictionaries contain complex data structures as values, such as lists, tuples, or even other dictionaries, the key function can be designed to sort based on an element or a combination of elements within these structures.

Example: Sorting by Value Then Key

• Python

Python

# Sample dictionary with potential value ties

votes = {'Alice': 90, 'Bob': 90, 'Charlie': 85, 'Diana': 90}

# Sorting by value, then by key in case of ties

sorted_votes = sorted(votes.items(), key=lambda x: (x[1], x[0]), reverse=True)

# Convert to dictionary

sorted_votes_dict = dict(sorted_votes)

print("Sorted by Value Then Key:", sorted_votes_dict)

You can also try this code with Online Python Compiler

Run Code

Output

In this example, the lambda function lambda x: (x[1], x[0]) tells Python to first sort by value (x[1]) and then by key (x[0]) in case of ties. Setting reverse=True sorts the dictionary in descending order by value, and in ascending order by key when values are equal.

Frequently Asked Questions

Can I sort a dictionary directly without converting it to a list of tuples?

Directly sorting a dictionary isn't possible because dictionaries prior to Python 3.7 don't maintain order. Sorting requires converting it to a list of tuples, sorting, and then if needed, converting it back to a dictionary.

How can I maintain the sorted order of a dictionary?

To maintain sorted order, use an OrderedDict from the collections module, especially if you're using Python versions older than 3.7. From Python 3.7 onwards, the standard dictionary maintains insertion order by default.

Is it more efficient to sort by keys instead of values?

Sorting by keys can be marginally more efficient due to the direct access pattern, but the difference is often negligible. The choice between sorting by keys or values should be based on your specific data handling needs rather than efficiency concerns.

Conclusion

Sorting dictionaries by value in Python is a fundamental technique that enhances data organization and manipulation capabilities. Through the use of the sorted() method, combined with lambda functions for specifying sorting criteria, Python programmers can efficiently order dictionary elements to suit various application needs. Understanding these sorting techniques is crucial for effective data analysis, algorithm optimization, and ensuring readability and accessibility of data structures in Python projects.

You can refer to our guided paths on the Coding Ninjas. You can check our course to learn more about DSA, DBMS, Competitive Programming, Python, Java, JavaScript, etc. 

Also, check out some of the Guided Paths on topics such as Data Structure and Algorithms, Competitive Programming, Operating Systems, Computer Networks, DBMS, System Design, etc., as well as some Contests, Test Series, and Interview Experiences curated by top Industry Experts.