锦标赛算法Python实现

锦标赛算法Python实现

本人代码小白，正在学习算法（以Python实现），每次找经典算法都是观摩大神的C/Java语言的代码，去写Python的，花费了不少时间，甚是心疼。
希望这篇文章能够帮到大家。

算法原理

https://blog.csdn.net/lsjseu/article/details/11704199

参考的Java代码

http://blog.csdn.net/hopeztm/article/details/7921686

Python代码

class Node:
    def __init__(self, _data, _id):
        self.data = _data
        self.id = _id
    def show(self):
        print(self.id, self.data)


def Adjust(data, idx):
    while (idx != 0):
        if (idx % 2 == 1):
            if (data[idx].data < data[idx + 1].data):
                data[(idx - 1) // 2] = data[idx]
            else:
                data[(idx - 1) // 2] = data[idx + 1]
            idx = (idx - 1) // 2
        else:
            if (data[idx - 1].data < data[idx].data):
                data[idx // 2 - 1] = data[idx - 1]
            else:
                data[idx // 2 - 1] = data[idx]
            idx = idx // 2 - 1
    return data


def Sort(data):
    length = len(data)
    n = 1
    while n < length:
        n <<= 1
        # print("n=",n)
    nTreeSize = 2 * n - 1
    nodes = []
    for i in range(nTreeSize):
        nodes.append(Node(0, 0))
    # 初始化竞赛数数据
    for i in range(n - 1, nTreeSize):
        idx = i - (n - 1)
        if idx < length:
            nodes[i] = Node(data[idx], i)
        else:
            nodes[i] = Node(9999, -1)
    for i in range(n - 2, -1, -1):
        if (nodes[i * 2 + 1].data < nodes[i * 2 + 2].data):
            nodes[i] = nodes[i * 2 + 1]
        else:
            nodes[i] = nodes[i * 2 + 2]
    # 实现排序
    B = []
    for i in range(0, length):
        # 取出最小的
        B.append(nodes[0].data)
        nodes[nodes[0].id].data = 9999
        Adjust(nodes, nodes[0].id)
    return B


if __name__ == "__main__":
    Arr = [2,5,9,1,11,20,15,7,4,6]
    Arr2 = Sort(Arr)
    print("newArr=",Arr2)