[알고리즘 공부] Heap Sort

파이썬은 힙정렬을 위해 heapq라는 모듈을 제공한다.

import heapq

def heap_sort(nums):
    heap = []
    for num in nums:
        heapq.heappush(heap, num)
    print(heap)
  
    sorted_nums = []
    while heap:
        sorted_nums.append(heapq.heappop(heap))
    print(sorted_nums)

heap_sort([4, 1, 7, 3, 8, 5])

 

[출력]

[1, 3, 5, 4, 8, 7]
[1, 3, 4, 5, 7, 8]