清华大佬耗费三个月吐血整理的几百G的资源，免费分享！....>>>

def bubblesort(s):
	x=0
	N=0
	n=0
	while N<(len(s)-1):
		while n<(len(s)-1):
			if s[x]>s[x+1]:
				s[x],s[x+1] = s[x+1],s[x]
			x+=1
			n+=1
		x=0
		n=0
		N+=1
	return s