heapsort.cpp

来自「经典c++程序的实现」· C++ 代码 · 共 26 行

#include <iostream.h>
#include "..\include\book.h"

typedef int ELEM;
#include "..\include\swap.h"
  
// Heapsort

#include "..\include\maxheap.h"

void heapsort(ELEM* array, int n) { // Heapsort
  int j;
  heap H(array, n, n);              // Build the heap

  for (int i=0; i<n; i++) {      // Now sort
    H.removemax();           // Removemax placed value at end of heap
    for (j=0; j<n; j++)     
      cout << array[j] << "  ";
    cout << "\n";
  }
}

void sort(ELEM* array, int listsize) {
  heapsort(array, listsize);
}