文件名称:DPG
介绍说明--下载内容均来自于网络,请自行研究使用
堆排序
一、 需求分析
问题定义:
假设定义堆为满足如下性质的完全三叉树:(1)空树为堆;(2)根结点的值不小于所有子树根的值,且所有子树均为堆。编写利用上述定义的堆进行排序的算法,并分析推导算法的时间复杂度。
-a heap sort, demand analysis definition : the assumption that to meet the definition of sculpture, the complete nature of trigeminal tree : (1) space for the tree sculpture; (2) Root in the value of not less than all-roots values, which are all subtrees heap. Prepared using the above definition of the heap for sorting algorithms, and analysis of the algorithm is derived time complexity.
一、 需求分析
问题定义:
假设定义堆为满足如下性质的完全三叉树:(1)空树为堆;(2)根结点的值不小于所有子树根的值,且所有子树均为堆。编写利用上述定义的堆进行排序的算法,并分析推导算法的时间复杂度。
-a heap sort, demand analysis definition : the assumption that to meet the definition of sculpture, the complete nature of trigeminal tree : (1) space for the tree sculpture; (2) Root in the value of not less than all-roots values, which are all subtrees heap. Prepared using the above definition of the heap for sorting algorithms, and analysis of the algorithm is derived time complexity.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
压缩包 : 41695047dpg.zip 列表 DPG.C