Initial data commit

Task/Sorting-algorithms-Permutation-sort/Jq/sorting-algorithms-permutation-sort-1.jq

@@ -0,0 +1,8 @@
+def permutations:
+  if length == 0 then []
+  else
+    . as $in
+    | range(0;length) as $i
+    | ($in|del(.[$i])|permutations)
+    | [$in[$i]] + .
+  end ;

Task/Sorting-algorithms-Permutation-sort/Jq/sorting-algorithms-permutation-sort-2.jq

@@ -0,0 +1,10 @@
+def sorted:
+  def until(cond; next):
+     def _until: if cond then . else (next|_until) end;
+     _until;
+
+  length as $length
+  | if $length <= 1 then true
+    else . as $in
+    | 1 | until( . == $length or $in[.-1] > $in[.] ; .+1) == $length
+  end;

Task/Sorting-algorithms-Permutation-sort/Jq/sorting-algorithms-permutation-sort-3.jq

@@ -0,0 +1,2 @@
+def permutation_sort_slow:
+  reduce permutations as $p (null; if . then . elif ($p | sorted) then $p else . end);

Task/Sorting-algorithms-Permutation-sort/Jq/sorting-algorithms-permutation-sort-4.jq

@@ -0,0 +1,9 @@
+def permutation_sort:
+  # emit the first item in stream that satisfies the condition
+  def first(stream; cond):
+     label $out
+     | foreach stream as $item
+         ( [false, null];
+           if .[0] then break $out else [($item | cond), $item] end;
+           if .[0] then .[1] else empty end );
+  first(permutations; sorted);

Task/Sorting-algorithms-Permutation-sort/Jq/sorting-algorithms-permutation-sort-5.jq

@@ -0,0 +1 @@
+["too", true, 1, 0, {"a":1},  {"a":0} ] | permutation_sort

Task/Sorting-algorithms-Permutation-sort/Jq/sorting-algorithms-permutation-sort-6.jq

@@ -0,0 +1,2 @@
+$ jq -c -n -f Permutation_sort.jq
+[true,0,1,"too",{"a":0},{"a":1}]