Initial data commit

Task/Sorting-algorithms-Patience-sort/11l/sorting-algorithms-patience-sort.11l

@@ -0,0 +1,36 @@
+F patience_sort(&arr)
+   I arr.len < 2 {R}
+
+   [[T(arr[0])]] piles
+   L(el) arr
+      L(&pile) piles
+         I pile.last > el
+            pile.append(el)
+            L.break
+      L.was_no_break
+         piles.append([el])
+
+   L(i) 0 .< arr.len
+      V min = piles[0].last
+      V minPileIndex = 0
+      L(j) 1 .< piles.len
+         I piles[j].last < min
+            min = piles[j].last
+            minPileIndex = j
+      arr[i] = min
+      V& minPile = piles[minPileIndex]
+      minPile.pop()
+      I minPile.empty
+         piles.pop(minPileIndex)
+
+V iArr = [4, 65, 2, -31, 0, 99, 83, 782, 1]
+patience_sort(&iArr)
+print(iArr)
+
+V cArr = [‘n’, ‘o’, ‘n’, ‘z’, ‘e’, ‘r’, ‘o’, ‘s’, ‘u’, ‘m’]
+patience_sort(&cArr)
+print(cArr)
+
+V sArr = [‘dog’, ‘cow’, ‘cat’, ‘ape’, ‘ant’, ‘man’, ‘pig’, ‘ass’, ‘gnu’]
+patience_sort(&sArr)
+print(sArr)