Python-三种排序：冒泡、希尔、快速排序

1.冒泡排序：（最简单）

>>> def sortpop(nums):
	"""
        :type n:List[int]
        :rtype:List[int]
        """
	for i in range(len(nums)):
		for j in range(i):
			if nums[i]<nums[j]:
				nums[i],nums[j]=nums[j],nums[i]
	return nums

>>> print(sortpop([random.randint(0,100)for i in range(10)]))
[15, 18, 27, 34, 52, 69, 71, 72, 75, 93]

2.希尔排序:(高级)

def sortxr(nums):
	"""
        :type n:List[int]
        :rtype:List[int]
        """
	n=len(nums)
	flag=n//2
	while flag>0:
		for i in range(flag,n):
			j=i
			while j>=flag and nums[j-flag]>nums[j]:
				nums[j-flag],nums[j]=nums[j],nums[j-flag]
				j-=flag
		flag=flag//2
	return nums
print(sortxr([random.randint(0,100)for i in range(10)]))
[0, 3, 26, 32, 33, 55, 73, 82, 91, 98]

3.快速排序：

def sort2(nums):
	"""
        :type n:List[int]
        :rtype:List[int]
        """
	if len(nums)<=1:
		return nums
	else:
		left,right=[],[]
		n=nums[0]
		for i in nums[1:]:
			if i<n:
				left.append(i)
			else:
				right.append(i)
	return sort2(left)+[n]+sort2(right)
print(sort2([random.randint(0,100)for i in range(10)]))

[1, 34, 62, 69, 73, 73, 75, 76, 77, 85]