Python | Sort the items alphabetically from given dictionary
Given a dictionary, write a Python program to get the alphabetically sorted items from given dictionary and print it. Let’s see some ways we can do this task.
Code #1: Using dict.items()
Python3
# Python program to sort the items alphabetically from given dictionary # initialising _dictionary dict = { 'key2' : 'For' , 'key3' : 'IsBeginner' , 'key1' : 'AGeek' , 'key4' : 'ZBeginner' } # printing initial_dictionary print ( "Original dictionary" , str ( dict )) # getting items in sorted order print ( "\nItems in sorted order" ) for key, value in sorted ( dict .items()): print (value) |
Output:
Original dictionary {‘key2’: ‘For’, ‘key3’: ‘IsBeginner’, ‘key1’: ‘AGeek’, ‘key4’: ‘ZBeginner’}
Items in sorted order
AGeek
For
IsBeginner
ZBeginner
Time Complexity: O(n*logn)
Auxiliary Space: O(n)
Code #2: Using sorted()
Python3
# Python program to sort the items alphabetically from given dictionary # initialising _dictionary dict = { 'key4' : 'ZBeginner' , 'key1' : 'AGeek' , 'key3' : 'IsBeginner' , 'key2' : 'For' } # printing initial_dictionary print ( "Original dictionary" , str ( dict )) # getting items in sorted order print ( "\nItems in sorted order" ) for key in sorted ( dict ): print ( dict [key]) |
Output:
Original dictionary {‘key4’: ‘ZBeginner’, ‘key1’: ‘AGeek’, ‘key3’: ‘IsBeginner’, ‘key2’: ‘For’}
Items in sorted order
AGeek
For
IsBeginner
ZBeginner
Time Complexity: O(n*logn)
Auxiliary Space: O(n)