Quick Sort Algorithm help

[Mrcrysis2000]

Pretty much i failed my exam on programming and i need to retake (not my strongest point) and this is one of the questions, 

 

In the language of your choice, show an implementation of the quick sort algorithm. It does not matter if the sort is in-place, returns a new sequence or takes a pointer to an empty list as a parameter. (python) 

 

So if anyone could show me how this is done and what each line is doing i may have a chance

 

Thanks

[manon_gfx]

For exmamples. Look here: http://rosettacode.org/wiki/Sorting_algorithms/Quicksort
I don't recommed looking at the C++ version, since that one is waaaay overly complex, instead look at the C version.

 

 

Here is an interactive explanation of quicksort: http://me.dt.in.th/page/Quicksort/

[Nineshadow]

function quicksort(array)    if length(array) > 1        pivot := select any element of array        left := first index of array        right := last index of array        while left ≤ right            while array[left] < pivot                left := left + 1            while array[right] > pivot                right := right - 1            if left ≤ right                swap array[left] with array[right]                left := left + 1                right := right - 1        quicksort(array from first index to right)        quicksort(array from left to last index)

In pseudocode. Just implement it in the programming language of your choice.