#Quick Sort in Python The third in a series of *sorting algorithms* developed in **python**, inspired by the visualization here: http://www.youtube.com/watch?v=kPRA0W1kECg . Quick sort is also know as a partition-exchange sort. ##Pros: - Despite the worst case making O(n^2) comparisons, usual performance is in the O( n log n) range. - Because it…

Quick Sort in Python

# setup; build a list with random elements
import random

lNums = []
for item in range(0,10):
	lNums.append(random.randint(0,1000))

print lNums

# quicksort using python's list comprehensions
def quicksort( tempList ):
	if tempList == []:
		return []
	else:
		# select and remove pivot element from list
		# there are several options for how to do this
		pivotValue = tempList[0]
		lesserList = quicksort( [x for x in tempList[1:] if x < pivotValue])
		greaterList = quicksort( [x for x in tempList[1:] if x >= pivotValue]) 
		return lesserList + [pivotValue] + greaterList

print quicksort( lNums )