文件名称:heapsort
介绍说明－－下载内容均来自于网络，请自行研究使用
A heap is a binary tree satisfying the following
conditions:
This tree is completely balanced.
If the height of this binary tree is h, then leaves
can be at level h or level h-1.
All leaves at level h are as far to the left as
possible.
The data associated with all descendants of a
node are smaller than the datum associated
with this node.-A heap is a binary tree satisfying the followingconditions :
conditions:
This tree is completely balanced.
If the height of this binary tree is h, then leaves
can be at level h or level h-1.
All leaves at level h are as far to the left as
possible.
The data associated with all descendants of a
node are smaller than the datum associated
with this node.-A heap is a binary tree satisfying the followingconditions :
(系统自动生成,下载前可以参看下载内容)
下载文件列表
heapsort
........\heapsort.cpp
........\heapsort.cpp