我主要负责的是希尔排序和堆排序。
堆排序:为什么不使用“软堆”来提高性能?
概要设计:本程序所使用的数据结构是树和线性表,所使用的算法主要有堆排序、赫夫曼算法。
Summary of design: the procedures used by the data structure is linear tree and table, the algorithm used by the main sculpture, in order Huffman algorithm.
堆排序的另外一个好处是它的速度非常稳定,这让它得以在那些需要严格计时的程序中派上用场(例如网络)。
Heap Sort has the additional benefit of being quite consistent in its speed, so it is useful in programs where timing is crucial (i. e. networks).
一种标准的方式来实现一个正常的二进制堆是使用一个数组,然后从左到右填充与隐式二进制堆(这是堆排序的方式通常是实现)。
A standard way to implement a normal binary heap is to use an array and then fill it from left to right with an implicit binary heap (this is the way heapsort is usually implemented).
一种标准的方式来实现一个正常的二进制堆是使用一个数组,然后从左到右填充与隐式二进制堆(这是堆排序的方式通常是实现)。
A standard way to implement a normal binary heap is to use an array and then fill it from left to right with an implicit binary heap (this is the way heapsort is usually implemented).
应用推荐