python---的topk算法

最新推荐文章于 2022-09-12 14:45:09 发布

hotpotbo

最新推荐文章于 2022-09-12 14:45:09 发布

阅读量6.3k

点赞数 1

分类专栏： python

本文链接：https://blog.csdn.net/hotpotbo/article/details/78350497

版权

python 专栏收录该内容

23 篇文章 0 订阅

订阅专栏

#! conding:utf-8

author = “hotpot”
date = “2017/10/26 9:42”

def quick_index(array, start, end):
    left, right = start, end
    key = array[left]
    while left < right:
        while left < right and array[right] > key:
            right -= 1
        array[left] = array[right]
        while left < right and array[left] < key:
            left += 1
        array[right] = array[left]

    array[left] = key
    return left


def min_num(array, m):
    start, end = 0, len(array) - 1
    index = quick_index(array, start, end)
    while index != m:
        if index < m:
            index = quick_index(array, index+1, end)
        else:
            index = quick_index(array, start, index)

    print(array[:m])

if __name__ == '__main__':
    alist = [15,54, 26, 93, 17, 77, 31, 44, 55, 20]

    min_num(alist,  5)