Initial data commit

Task/Sorting-algorithms-Patience-sort/Python/sorting-algorithms-patience-sort.py

@@ -0,0 +1,27 @@
+from functools import total_ordering
+from bisect import bisect_left
+from heapq import merge
+
+@total_ordering
+class Pile(list):
+    def __lt__(self, other): return self[-1] < other[-1]
+    def __eq__(self, other): return self[-1] == other[-1]
+
+def patience_sort(n):
+    piles = []
+    # sort into piles
+    for x in n:
+        new_pile = Pile([x])
+        i = bisect_left(piles, new_pile)
+        if i != len(piles):
+            piles[i].append(x)
+        else:
+            piles.append(new_pile)
+
+    # use a heap-based merge to merge piles efficiently
+    n[:] = merge(*[reversed(pile) for pile in piles])
+
+if __name__ == "__main__":
+    a = [4, 65, 2, -31, 0, 99, 83, 782, 1]
+    patience_sort(a)
+    print a