qs.py

import random
import time

array = []
for i in range(1000000):
    array.append(random.randint(1, 100))

def q_sort(nums):
    if not nums:
        return []
    pivort = nums[-1]
    prev_list = [item for item in nums if item < pivort]
    follow_list = [item for item in nums if item > pivort]

    return q_sort(prev_list) + [pivort] * (len(nums) - len(prev_list) - len(follow_list)) + q_sort(follow_list)

def bubblesort(nums):
    max_num = max(nums)
    others = [ item for item in nums if not item == max_num ]
    if others:
        return bubblesort(others) + [max_num] * (len(nums) - len(others))
    else:
        return []


print time.time()
bubblesort(array)
print time.time()
q_sort(array)
print time.time()