Sort nested dictionary by value, and remainder by another value, in Python

Question

Consider this dictionary format.

{\'KEY1\':{\'name\':\'google\',\'date\':20100701,\'downloads\':0},
 \'KEY2\':{\'name\':\'chrome\',\'date\':20071010,\'downlo         


        

Answer 1

My other answer was wrong (as are most of the answers here)

sorted_keys = sorted((key for key in outer_dict if outer_dict[key]['downloads']),
                     key=lambda x: (outer_dict[key]['downloads'],
                                    outer_dict[key]['downloads'])
                     reverse=True)

sorted_keys += sorted((key for key in outer_dict if not outer_dict[key]['downloads']),
                      key=lambda x: outer_dict[key]['date'])

This will create a list with the items that have been downloaded sorted in descending order at the front of it and the rest of the items that have not been downloaded sorted by date after those that have.

But actually, the last part of Eli Courtwrights answer is the best.