python排序

x = [6,1,4,5,6,6,7,8,9,2,3,4,5]
#冒泡排序 bubble sort
#重复地走访过要排序的数列，一次比较两个元素，如果它们的顺序错误就把它们交换过来
def bubblesort(nums):
    for i in range(len(nums)):
        for j in range(len(nums)-1):
            if nums[j] > nums[j+1]:
                nums[j], nums[j+1] = nums[j+1],nums[j]
    return nums
print(bubblesort(x))

#选择排序 selection sort
#首先在未排序序列中找到最小（大）元素，存放到排序序列的起始位置，然后，再从剩余未排序元素中继续寻找最小（大）元素，然后放到已排序序列的末尾。以此类推，直到所有元素均排序完毕。
def selectionsort(nums):
    for i in range(len(nums)):
        mins = i
        for j in range(mins+1, len(nums)):
            if nums[j] < nums[mins]:
                nums[mins], nums[i] = nums[i], nums[mins]
    return nums
print(selectionsort(x))

#插入排序 insertion sort
#通过构建有序序列，对于未排序数据，在已排序序列中从后向前扫描，找到相应位置并插入。
def insertionsort(nums):
    for i in range(1, len(nums)):
        for j in range(i):
            if nums[i] >= nums[j] and nums[i] < nums[j+1]:
                loc = nums[i]
                for k in range(j+1, len(nums)-1):
                    nums[k+1] = nums[k]
                nums[j] = loc
    return nums
print(insertionsort(x))

#快排 quick sort link: https://wiki.jikexueyuan.com/project/easy-learn-algorithm/fast-sort.html
def partition(arr, low, high):
    i = low  # 最小元素索引
    pivot = arr[high]
    for j in range(low, high):
        # 当前元素小于或等于 pivot
        if arr[j] <= pivot:
            arr[i], arr[j] = arr[j], arr[i]
            i = i + 1
    arr[i], arr[high] = arr[high], arr[i]
    return i

# arr[] --> 排序数组
# low  --> 起始索引
# high  --> 结束索引
# 快速排序函数
def quickSort(arr, low, high):
    if low < high:
        pi = partition(arr, low, high)
        quickSort(arr, low, pi - 1)
        quickSort(arr, pi + 1, high)

quickSort(x, 0, len(x)-1)
print("排序后的数组:")
print(x)