Sorting algorithms/Quicksort: Difference between revisions
Content added Content deleted
Line 2,782:
=={{header|Nimrod}}==
<lang nimrod>
proc quickSort[T](a: var seq[T], inl = 0, inr = -1) =
if len(list) == 0:▼
var r = if inr >=
var l = inl
let n
if n < 2: return
let p
while l <= r:
inc
if
dec
continue
swap a[l], a[r]
inc l
dec r
quickSort(a, inl, r)
quickSort(a, l, inr)
var a = @[4, 65, 2, -31, 0, 99, 2, 83, 782]
quickSort a
echo a</lang>
Output:
<pre>@[-31, 0, 2, 2, 4, 65, 83, 99, 782]</pre>
=={{header|Objeck}}==
|