def max1(a):
if len(a)==1:
return 0
elif len(a)==2:
if a[0]>a[1]:
return a[0]
else:
return a[1]
else:
z=max1(a[0:len(a)//2])
y=max1(a[len(a)//2:])
if y>z:
return y
else:
return z
def sort(a):
if len(a)<=1:
return a
elif len(a)==2:
if a[0]>a[1]:
return a[::-1]
else:
return a
else:
z=len(a)//2
o=a[z]
left,right=[],[]
for i in range(len(a)):
if a<=o and i!=z:
left.append(a)
elif a>o:
right.append(a)
y=max1 (a[len(a)//2:])
return sort(left)+[o]+sort(right)
print(sort([2,6,2,6,33,7,3]))
if len(a)==1:
return 0
elif len(a)==2:
if a[0]>a[1]:
return a[0]
else:
return a[1]
else:
z=max1(a[0:len(a)//2])
y=max1(a[len(a)//2:])
if y>z:
return y
else:
return z
def sort(a):
if len(a)<=1:
return a
elif len(a)==2:
if a[0]>a[1]:
return a[::-1]
else:
return a
else:
z=len(a)//2
o=a[z]
left,right=[],[]
for i in range(len(a)):
if a<=o and i!=z:
left.append(a)
elif a>o:
right.append(a)
y=max1 (a[len(a)//2:])
return sort(left)+[o]+sort(right)
print(sort([2,6,2,6,33,7,3]))