aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

Initial data commit

Browse source
This commit is contained in:
Ingy döt Net 2023-07-01 11:58:00 -04:00
parent 72d218235f
commit f23f22d71c
199087 changed files with 3378941 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

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

@ -0,0 +1 @@
quicksort:{f:*x@1?#x;:[0=#x;x;,/(_f x@&x<f;x@&x=f;_f x@&x>f)]}

1
Task/Sorting-algorithms-Quicksort/K/sorting-algorithms-quicksort-2.k Normal file
View file

@ -0,0 +1 @@
quicksort 1 3 5 7 9 8 6 4 2

1
Task/Sorting-algorithms-Quicksort/K/sorting-algorithms-quicksort-3.k Normal file
View file

@ -0,0 +1 @@
_f()

1
Task/Sorting-algorithms-Quicksort/K/sorting-algorithms-quicksort-4.k Normal file
View file

@ -0,0 +1 @@
:[....]

1
Task/Sorting-algorithms-Quicksort/K/sorting-algorithms-quicksort-5.k Normal file
View file

@ -0,0 +1 @@
f:*x@1?#x

9
Task/Sorting-algorithms-Quicksort/K/sorting-algorithms-quicksort-6.k Normal file
View file

@ -0,0 +1,9 @@
:[
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
]

1
Task/Sorting-algorithms-Quicksort/K/sorting-algorithms-quicksort-7.k Normal file
View file

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