Sorting algorithms/Quicksort: Difference between revisions

qsort (x:xs) = qsort ys ++ x : qsort zs where (ys, zs) = partition (<= x) xs

 

IDL has a powerful optimized <tt>sort()</tt> built-in. The following is thus merely for demonstration.

 

-5 3 12 17 99

 

fn quickSort arr =

(

a = quickSort a

 

def quickSort(arr):

less = []

a = quickSort(a)

 

<pre>

const proc: quickSort (inout array elemType: arr, in integer: left, in integer: right) is func