from random import choice
def hoar_sort(A):
 from random import choice
def hoar_sort(A):
if len(A)<=1:
return A
barier=random.choice(A)
left=[x for x in A if x<barier]
middle=[x for x in A if x==barier]
rigt=[x for x in A if x>barier]
left=hoar_sort(left)
right=hoar_sort(right)
return left+middle+right

 # it should look this way?
from random import choice
#def hoar_sort(A):
#    from random import choice
def hoar_sort(A):
    if len(A) <= 1:
        return A
    barier = random.choice(A)
    left = [x for x in A if  x < barier]
    middle = [x for x in A if x == barier]
    rigt = [x for x in A if x > barier]
    left = hoar_sort(left)
    right = hoar_sort(right)
    return left + middle + right

 from random import choice
def hoar_sort(A):
    if len(A) <= 1:
        return A
    barier = choice(A)
    left = [x for x in A if  x < barier]
    middle = [x for x in A if x == barier]
    right = [x for x in A if x > barier]
    left = hoar_sort(left)
    right = hoar_sort(right)
    return left + middle + right
A=[2,4,3,6,4,7,5,1,2,4,3]
x=hoar_sort(A)
print(x)