排序算法(python代码)

python实现快速排序

def quick_sort(arr,start,end):
    if start >= end:
        return
    mid = arr[start]
    left = start
    right = end
    while left < right:
        while arr[right] >= mid and left < right:
            right -= 1
        arr[left] = arr[right]
        while arr[left] < mid and left < right:
            left += 1
        arr[right] = arr[left]
        arr[left] = mid
    quick_sort(arr,start,left-1)
    quick_sort(arr,right+1,end)
if __name__ == "__main__":
    array = [14123,4,3,4,123,4,,132,4,12,3,4,12,34,123,4,12,34,1]
    quick_sort(array, 0, len(array)-1)
    print(array)

python实现冒泡排序

def bubble_sort(array):
    for i in range(1, len(array)):
        for j in range(0, len(array)-i):
            if array[j] > array[j+1]
                array[j], array[j+1] = array[j+1], array[j]
    return array

if __name__ == "__main__":
    array = [10,234,32,4,32,4,32,4,3,4,123,4,132,4]
    print(bubble_sort(array))

python实现插入排序

def insert_sort(array):
    for i in range(len(array)):
        cur_index = i
        while array[cur_index-1] > array[cur_index] and cur_index-1 >= 0:
            array[cur_index], array[cur_index-1] = array[cur_index-1], array[cur_index]
            cur_index -= 1
    return array

if __name__ == "__main__":
    array = [324,32,4,132,41,32,4,31,5,124,13,5,4,324,1,5,1]
    print(insert_sort(array))

python实现选择排序

def selection_sort(array):
    for i in range(len(array)-1):
        min_index = i
        for j in range(i+1, len(array)):
            if array[j] < array[min_index]:
                min_index = j
        if min_index != i:
            array[i], array[min_index] = array[min_index], array[i]
    return array

if __name__ == "__main__":
    array = [32,4,13,4,13,24,132,4,132,4,1,32,5,45,14,1,32,41,6,4,1324,123]
    print(selection_sort(array))