Quick sort in python

def quickSort(nums):
    
    low = []
    equal = []
    hi = []
    l = len(nums)
    
    if l>1:
        v = nums[0]
        for n in nums:
            if n < v:
                low.append(n)
            elif n>v:
                hi.append(n)
            else:
                equal.append(n)
                
        return quickSort(low) + equal + quickSort(hi)
    else:
        return nums
    
    
nums = [10,6,9,2,1,7,8,11,90,111]
print quickSort(nums)