September 2017 Update

Task/Sorting-algorithms-Quicksort/Jq/sorting-algorithms-quicksort-1.jq

@@ -0,0 +1 @@
+[1, 1.1, [1,2], true, false, null, {"a":1}, null] | sort

Task/Sorting-algorithms-Quicksort/Jq/sorting-algorithms-quicksort-2.jq

@@ -0,0 +1 @@
+[null,null,false,true,1,1.1,[1,2],{"a":1}]

Task/Sorting-algorithms-Quicksort/Jq/sorting-algorithms-quicksort-3.jq

@@ -0,0 +1,13 @@
+def quicksort:
+  if length < 2 then .                            # it is already sorted
+  else .[0] as $pivot
+       | reduce .[] as $x
+         # state: [less, equal, greater]
+           ( [ [], [], [] ];                      # three empty arrays:
+             if   $x  < $pivot then .[0] += [$x]  # add x to less
+             elif $x == $pivot then .[1] += [$x]  # add x to equal
+             else                   .[2] += [$x]  # add x to greater
+             end
+         )
+       | (.[0] | quicksort ) + .[1] + (.[2] | quicksort )
+  end ;