x = {1: 2, 3: 4, 4: 3, 2: 1, 0: 0}
sort_by_key = dict(sorted(x.items(),key=lambda item:item[0]))
sort_by_value = dict(sorted(x.items(), key=lambda item: item[1]))
print("sort_by_key:", sort_by_key)
print("sort_by_value:", sort_by_value)
# sort_by_key: {0: 0, 1: 2, 2: 1, 3: 4, 4: 3}
# sort_by_value: {0: 0, 2: 1, 1: 2, 4: 3, 3: 4}newlist = sorted(list_to_be_sorted, key=lambda k: k['name']) x = {1: 2, 3: 4, 4: 3, 2: 1, 0: 0}
{k: v for k, v in sorted(x.items(), key=lambda item: item[1])}
{0: 0, 2: 1, 1: 2, 4: 3, 3: 4}x = {'a':1, 'b':2, 'c':3, 'd':4, 'e':5}
accending_x_keys = sorted(x, key=x.get)
descending_x_keys = sorted(x, key=x.get, reverse=True)
for k in accending_x_keys:
print(k, x.get(k), end=" ")
#output: a 1 b 2 c 3 d 4 e 5
for v in descending_x_keys:
print(v, x.get(v), end=" ")
#output: e 5 d 4 c 3 b 2 a 1x = {1: 2, 3: 4, 4: 3, 2: 1, 0: 0}
{k: v for k, v in sorted(x.items(), key=lambda item: item[1])}#instead of using python inbuilt function we can it compute directly.
#here iam sorting the values in descending order..
d = {1: 1, 7: 2, 4: 2, 3: 1, 8: 1}
s=[]
for i in d.items():
s.append(i)
for i in range(0,len(s)):
for j in range(i+1,len(s)):
if s[i][1]<s[j][1]:
s[i],s[j]=s[j],s[i]
print(dict(s))