Quicksort in Python

sort.py

#!/usr/bin/python3

import random

def sorted(l):
    if len(l) == 0:
        return l
    else:
        x, *xs = l
        left, right = [], []
        for i in xs:
            if i < x:
                left.append(i)
            else:
                right.append(i)
        sleft, sright = sorted(left), sorted(right)
        return sleft + [x] + sright

l = [random.randint(1, 1000) for _ in range(100)]

print(l)
print(sorted(l))