Snippets

Camilo Rocha Heapsort algorithm using minimal heaps

Created by Camilo Rocha
heapsort.py
Raw 
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
from minheap import minheap

def heapsort(a):
  """heapsort algorithm using minheap as an auxiliary data structure
  """
  h = minheap(len(a))
  for x in a: h.insert(x)
  for i in range(len(a)):
    a[i] = h.get_min()
    h.remove_min()

Comments (0)

HTTPS SSH

You can clone a snippet to your computer for local editing. Learn more.