ar = []

def quick(l, r):
	if (r-l) <= 1:
		return
	
	pivot = ar[l]
	i = l+1
	for j in range(l+1,r):
		if ar[j] < pivot:
			ar[i],ar[j] = ar[j],ar[i]
			i+=1
			
	ar[i-1],ar[l] = ar[l],ar[i-1]
	# print i,j
	quick(l,i)
	quick(i,r)

		
def qSort():
	l = 0
	r = len(ar)
	quick(l,r)

ar = [1, 13, 10, 7, 3]

qSort()
print ar