Data update

Task/Sorting-algorithms-Quicksort/K/sorting-algorithms-quicksort-1.k

@@ -1 +1 @@
-quicksort:{f:*x@1?#x;:[0=#x;x;,/(_f x@&x<f;x@&x=f;_f x@&x>f)]}
+qsort:{$[2>#?x;x;,/o'x@&'~:\x<*1?x]}

Task/Sorting-algorithms-Quicksort/K/sorting-algorithms-quicksort-2.k

@@ -1 +1 @@
-    quicksort 1 3 5 7 9 8 6 4 2
+quicksort:{p:*x[1?#x];:[0=#x;x;,/(_f x[&x<p];x[&x=p];_f x[&x>p])]}

Task/Sorting-algorithms-Quicksort/K/sorting-algorithms-quicksort-3.k

@@ -1 +1 @@
-  _f()
+    quicksort 1 3 5 7 9 8 6 4 2

Task/Sorting-algorithms-Quicksort/K/sorting-algorithms-quicksort-4.k

@@ -1 +1 @@
-   :[....]
+  _f

Task/Sorting-algorithms-Quicksort/K/sorting-algorithms-quicksort-5.k

@@ -1 +1 @@
-   f:*x@1?#x
+   :[....]

Task/Sorting-algorithms-Quicksort/K/sorting-algorithms-quicksort-6.k

@@ -1,9 +1 @@
-    :[
-        0=#x;           / if length of x is zero
-        x;              / then return x
-                        / else
-        ,/(             / join the results of:
-          _f x@&x<f         / sort (recursively) elements less than f (pivot)
-          x@&x=f            / element equal to f
-          _f x@&x>f)        / sort (recursively) elements greater than f
-     ]
+   p:*x[1?#x]

Task/Sorting-algorithms-Quicksort/K/sorting-algorithms-quicksort-7.k

@@ -1 +1,9 @@
-   t@<t:1 3 5 7 9 8 6 4 2
+    :[
+        0=#x;           / if length of x is zero
+        x;              / then return x
+                        / else
+        ,/(             / join the results of:
+          _f x[&x<p]         / sort (recursively) elements less than pivot p
+          x[&x=p]            / elements equal to p
+          _f x[&x>p])        / sort (recursively) elements greater than p
+     ]

Task/Sorting-algorithms-Quicksort/K/sorting-algorithms-quicksort-8.k

@@ -0,0 +1 @@
+   t@<t:1 3 5 7 9 8 6 4 2