View difference between Paste ID: 4GNZ7h78 and gD5K045D

-#!/usr/bin/python2
+#!/usr/bin/python3
 
 
 """Demonstrates sorting dicts based on keys that might be missing"""
 
 
 def make_keyfun(key, missingfirst=True):
     def keyfun(item):
         try:
             value = item[key]
         except KeyError:
-    key = 'foo'
+            return (not missingfirst, )
-    def cmp_(first, second):
+
-        keysfound = [True, True]
+            return (missingfirst, value)
-        values = []
+    return keyfun
-        for index, item in enumerate((first, second)):
+
-            try:
+
-                value = item[key]
+
-            except KeyError:
+
-                keysfound[index] = False
+
-            else:
+
-                values.append(value)
+    print(sorted(listofdicts, key=make_keyfun('foo', missingfirst=False)))
-        if all(keysfound):
+
-            return cmp(*values)
+
 if __name__ == '__main__':
-            return cmp(*reversed(keysfound))
+