quicksort.py

def quicksort(nums,size):
	i = 1
	las = 1
	if size < 2:
		return
	while size > i:
		if nums[0] < nums[i]:
			swap = nums[las]
			nums[las] = nums[i]
			nums[i] = swap
			las = las + 1
		i = i +1
	
	swap = nums[0]
	nums[0] = nums[las-1]
	nums[las-1] = swap
	quicksort(nums,las)
	quicksort(nums.del(1>last),size-las)


i = 0
data = [46,22,34,74,85,56,18]
lenth = 7
while i < lenth:
	print data[i]
	i += 1

quicksort(data,lenth)

while i < lenth:
	print data[i]
	i += 1