tutorialsPythonBasic.basic.sorting.quicksort module

A simple Quick sort implementation:

http://en.wikipedia.org/wiki/Quicksort

tutorialsPythonBasic.basic.sorting.quicksort.quickSort(li)

Sort a list by choosing a pivot and putting all lesser elements to one side and all greater elements to the other side. Repeat on each side and add them back together.

>>> quickSort([1, 2, 3, 4, 5])
[1, 2, 3, 4, 5]
>>> quickSort([5, 4, 3, 2, 1])
[1, 2, 3, 4, 5]
>>> quickSort([3, 2, 6, 1, 4, 2, 3, 1, 1, 5, 6, -2, 2.3])
[-2, 1, 1, 1, 2, 2, 2.3, 3, 3, 4, 5, 6, 6]