Using quicksort for shuffling an array

shuffle.py

import random

def cmp(a, b):
    i = random.randint(0, 1)
    if i == 1:
        return True
    return False

def quicksort(q, cmp):
    lesser=[]
    greater=[]
    if len(q) <= 1:
        return q
    for i in q[1:]:
        if cmp(i, q[0]):
            lesser.append(i)
        else:
            greater.append(i)
    return quicksort(lesser, cmp)+q[0:1]+quicksort(greater, cmp)

data = range(1, 10)
data = quicksort(data, cmp)
print data