Sorting algorithms/Merge sort: Difference between revisions
m
→{{header|J}}
(Tacit Recursive Solution added) |
m (→{{header|J}}) |
||
Line 4,170:
<syntaxhighlight lang="j">case=. 1 * (0 = # x=. @:[) + 2 * (0 = # y=. @:])
merge=. ({.x , }.x $: ])`(({.y , }.y $: [))@.({.x > {.y)`]`[@.case
mergesort=. (>: o ? o # ($: o {. merge $: (o=. @:) }.) ]) ^: (1 < #)</syntaxhighlight>
Example use:
|