python实现堆排序

以下代码仅为自己笔记，不提供参考，但可自行优化！

import time
import sys
import re


def adjust_heap(lists):
    """建造大头堆的第一步，每调节一次，则至少保证一个节"""
    last_not_leave = (len(lists) // 2) - 1  # 从最后一个非叶子节点
    adjust = last_not_leave
    while adjust >= 0:
        lchild = adjust * 2 + 1
        rchild = adjust * 2 + 2
        if lchild < len(lists) and lists[adjust] <= lists[lchild]:
            lists[adjust], lists[lchild] = lists[lchild], lists[adjust]
        if rchild < len(lists) and lists[adjust] <= lists[rchild]:
            lists[adjust], lists[rchild] = lists[rchild], lists[adjust]
        adjust -= 1


def build_heap(lists):
    """分别对所有的非叶子节点进行修改，直到建成堆为止"""
    for i in range(len(lists) // 2):
        adjust_heap(lists)


def heap_sort(lists):
    """进行堆排序

    """
    sorted_lists = []
    for i in range(len(lists)):
        build_heap(lists)
        sorted_lists.append(lists[0])
        lists[0] = lists[len(lists) - 1]
        lists.pop()
    return sorted_lists[::-1]


def get_lists():
	"""获得用户输入的堆节点数据"""
    print("请输入堆的各个节点数据，每个数据非数字隔开:")
    string = sys.stdin.readline().strip()
    regex = re.compile(r"\D+")
    print(string)
    lists = [int(x) for x in regex.split(string)]
    return lists


if __name__ == "__main__":
    #     l = [1, 5, 3, 7, 0, 4, 23, 56]
    l = get_lists()
    start_time = time.time()
    result = heap_sort(l)
    end_time = time.time()
    running_time = end_time - start_time
    print("running time is {}".format(running_time))
    print("排序结果是：", result)