Quickselect algorithm: Difference between revisions
added Arturo
MaiconSoft (talk | contribs) (Added Delphi example) |
Drkameleon (talk | contribs) (added Arturo) |
||
Line 371:
{{Out}}
<pre>{0, 1, 2, 3, 4, 5, 6, 7, 8, 9}</pre>
=={{header|Arturo}}==
<lang rebol>quickselect: function [a k][
arr: new a
while ø [
indx: random 0 (size arr)-1
pivot: arr \ indx
remove 'arr .index: indx ø
left: select arr 'item -> item<pivot
right: select arr 'item -> item>pivot
case [k]
when? [= size left]-> return pivot
when? [< size left]-> arr: new left
else [
k: (k - size left) - 1
arr: new right
]
]
]
v: [9 8 7 6 5 0 1 2 3 4]
print map 0..(size v)-1 'i ->
quickselect v i</lang>
{{out}}
<pre>0 1 2 3 4 5 6 7 8 9</pre>
=={{header|AutoHotkey}}==
| |||