Jump to content

Sorting algorithms/Quicksort: Difference between revisions

Sorting algorithms/Quicksort (view source)

Revision as of 20:15, 28 April 2008

85 bytes added ,  16 years ago
→‎{{header|V}}: Using binrec like joy
(→‎{{header|V}}: Using binrec like joy)
Line 464:
 
[qsort
[joinparts [pivotp [*list1l1] [*list2l2] : [*list1l1 pivotp *list2l2]] view].
[split_on_first_elementsplit_on_first uncons [>] split&].
[small?]
[]
[split_on_first_elementsplit_on_first [list1l1 list2l2 : [list1l1 qsort list2l2 qsort joinparts]] view i]
ifte].
 
The way of joy (using binrec)
[qsort
[small?] []
[uncons [>] split&]
[[p [*l] [*g] : [*l p *g]] view]
binrec].
Rahul
418

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/34595"
Cookies help us deliver our services. By using our services, you agree to our use of cookies.
More information