# Quicksort

```class Quicksort {

static var arr = [4,8,0,3,9,1,5,2,6,7];

static function quicksort( lo : Int, hi : Int ) : Void {
var i = lo;
var j = hi;
var buf = arr;
var p = buf[(lo+hi)>>1];
while( i <= j ) {
while( arr[i] > p ) i++;
while( arr[j] < p ) j--;
if( i <= j ) {
var t = buf[i];
buf[i++] = buf[j];
buf[j--] = t;
}
}
if( lo < j ) quicksort( lo, j );
if( i < hi ) quicksort( i, hi );
}

static function main() {
quicksort( 0, arr.length-1 );
trace(arr);
}
}```

Quicksort sorts by employing a divide and conquer strategy to divide a list into two sub-lists.

The steps are:

• Pick an element, called a pivot, from the list.
• Reorder the list so that all elements which are less than the pivot come before the pivot and so that all elements greater than the pivot come after it (equal values can go either way). After this partitioning, the pivot is in its final position. This is called the partition operation.
• Recursively sort the sub-list of lesser elements and the sub-list of greater elements.

version #6832, modified 2009-08-21 13:04:34 by tong