排序算法python实现

在这里插入代码片@TOC

排序算法

堆排序

# utf-8
import numpy as np
from time import *


# 随机数的生成
def random_num(n):
    index = np.random.randint(1, 10000, n)
    index = list(index)
    return index


# 将以k为根的子树调整为大根堆
def head_adjust(arr, k, length):
    arr[0] = arr[k]
    i = 2 * k
    while i <= length:
        if i < length and arr[i] < arr[i + 1]:
            i = i + 1
        if arr[0] >= arr[i]:
            break
        else:
            arr[k] = arr[i]
            k = i
        i = i * 2
    arr[k] = arr[0]


# 建立大根堆
def build_maxheap(arr, length):
    i = length // 2
    while i > 0:
        head_adjust(arr, i, length)
        i = i - 1


# 堆排序
def head_sort(arr, length):
    index = []
    build_maxheap(arr, length)
    for i in range(length, 1, -1):
        temp = arr[i]
        arr[i] = arr[1]
        arr[1] = temp
        index.insert(0, arr[i])
        arr.pop()
        head_adjust(arr, 1, i - 1)
    index.insert(0,arr[1])
    return index


if __name__ == '__main__':
    n = int(input('请输入数据规模：'))
    begin_time = time()
    arr = random_num(n)
    arr.insert(0, 0)
    print('排序前：', arr)
    index = head_sort(arr, len(arr) - 1)
    print('排序后：', index)

插入排序

def random_num(n):
    index = np.random.randint(1, 10000000, n)
    index = list(index)
    return index

def insert_sort(n):
    index = random_num(n)
    print('排序之前：', index)
    for i in range(1, n):
        temp = index[i]
        j = i - 1
        while j >= 0 and temp < index[j]:
            index[j + 1] = index[j]
            j = j - 1
        index[j + 1] = temp
    return index

选择排序

def random_num(n):
    index = np.random.randint(1, 10000000, n)
    index = list(index)
    return index

def select_sort(n):
    index = random_num(n)
    print('排序之前：', index)
    for i in range(n-1):
        min = i
        for j in range(i+1,n):
            if index[j] < index[min]:
                min = j
        temp = index[i]
        index[i] = index[min]
        index[min] = temp
    return index
 

快速排序

# 随机数的生成
def random_num(n):
    index = np.random.randint(1, 10000000, n)
    index = list(index)
    return index


def partition(arr, low, high):
    # pivot = arr[random.randint(low, high)]  # 随机取一个数为中轴
    pivot = arr[low]
    while low < high:
        while low < high and arr[high] >= pivot:
            high = high - 1
        arr[low] = arr[high]
        while low < high and arr[low] <= pivot:
            low = low + 1
        arr[high] = arr[low]
    arr[low] = pivot
    return low


def quick_sort(arr, low, high):
    if low < high:
        pivotpos = partition(arr, low, high)
        quick_sort(arr, low, pivotpos - 1)
        quick_sort(arr, pivotpos + 1, high