How to sort list of dictionaries Python by multiple keys

In the world of Python programming, managing and organizing data is a crucial skill. When dealing with a list of dictionaries, the ability to sort based on multiple keys becomes invaluable. In this blog post, we will explore the elegant and efficient methods of sorting a list of dictionaries in Python by multiple keys, offering a versatile approach to data manipulation.

Sorting by Multiple Keys:

Let’s consider a list of dictionaries representing books:

books = [
    {'title': 'The Great Gatsby', 'author': 'F. Scott Fitzgerald', 'year': 1925},
    {'title': 'To Kill a Mockingbird', 'author': 'Harper Lee', 'year': 1960},
    {'title': '1984', 'author': 'George Orwell', 'year': 1949},
    {'title': 'Brave New World', 'author': 'Aldous Huxley', 'year': 1932}
]

To sort this list by multiple keys, first by ‘year’ and then by ‘author’, we can use the following:

sorted_books = sorted(books, key=lambda x: (x['year'], x['author']))
print(sorted_books)

This results in the list being sorted first by the ‘year’ key in ascending order, and then within each year, it is sorted by the ‘author’ key.

Why Use These Methods?

1. Versatility:
   • The tuple inside the lambda function allows for sorting by multiple keys in a customizable manner.
2. Efficiency:
   • The sorted() function efficiently handles sorting based on the specified keys.
3. Readability:
   • The lambda function provides a clear and readable way to express the sorting criteria.

Conclusion:

Sorting lists of dictionaries by multiple keys in Python is a skill that can greatly enhance your ability to manage and analyze diverse datasets. As you navigate the complexities of data manipulation, incorporating these sorting techniques into your toolkit will prove invaluable. With the power of Python, you can effortlessly organize and make sense of your data based on your specific criteria.

Happy coding!