hsort2.cpp

来自「数据结构c++语言描述 Borland C++实现」· C++ 代码 · 共 21 行

// should be faster heap sort

#include <iostream.h>
#include "hsort2.h"

void main(void)
{
   int a[21], i, n = 10;
   // initialize descending data
   for (i = 1; i <= 10; i++)
      a[i] = n-i+1;

   HeapSort(a,10);

   // output sorted data
   for (i = 1; i <= n; i++) 
      cout << a[i] << ' ';
   cout << endl;
}