Sorting algorithms/Quicksort: Difference between revisions

Content added Content deleted
(→‎{{header|V}}: Using binrec like joy)
Line 464: Line 464:


[qsort
[qsort
[joinparts [pivot [*list1] [*list2] : [*list1 pivot *list2]] view].
[joinparts [p [*l1] [*l2] : [*l1 p *l2]] view].
[split_on_first_element uncons [>] split&].
[split_on_first uncons [>] split&].
[small?]
[small?]
[]
[]
[split_on_first_element [list1 list2 : [list1 qsort list2 qsort joinparts]] view i]
[split_on_first [l1 l2 : [l1 qsort l2 qsort joinparts]] view i]
ifte].
ifte].

The way of joy (using binrec)
[qsort
[small?] []
[uncons [>] split&]
[[p [*l] [*g] : [*l p *g]] view]
binrec].