/********************************************************************
created: 2007/3/18
filename: main.cpp
author: Lichuang
purpose: 測(cè)試模擬堆算法
*********************************************************************/
#include <algorithm>
#include <iostream>
#include <time.h>
using namespace std;
// push_heap為向堆中添加一個(gè)新的元素, 調(diào)用這個(gè)算法的前提是[First, Last)之間的元素滿足堆的條件
// 新加入的元素為L(zhǎng)ast
void push_heap(int* pFirst, int* pLast);
// pop_heap為從堆中刪除一個(gè)元素, 調(diào)用這個(gè)算法的前提是[First, Last)之間的元素滿足堆的條件
// 被刪除的元素被放置到Last - 1位置,由于這里是max-heap,所以被刪除的元素是這個(gè)序列中最大的元素
void pop_heap(int* pFirst, int* pLast);
// make_heap將序列[First, Last)中的元素按照堆的性質(zhì)進(jìn)行重組
void make_heap(int* pFirst, int* pLast);
// 對(duì)堆進(jìn)行排序, 調(diào)用這個(gè)函數(shù)可以成功排序的前提是[pFirst, pLast)中的元素符合堆的性質(zhì)
void sort_heap(int* pFirst, int* pLast);
// 判斷一個(gè)序列[First, Last)是否滿足堆的條件,是就返回1,否則返回0
char is_heap(int* pFirst, int* pLast);
void test_heap_algo(int *pArray, int nLength);
void test_heap_algo_in_stl(int *pArray, int nLength);
void display_array(int *pArray, int nLength);
int main()
{
srand(time(NULL));
int Array[10], Array2[10];
for(int i = 0; i < 10; ++i)
Array[i] = Array2[i] = rand();
test_heap_algo(Array, sizeof(Array) / sizeof(int));
test_heap_algo_in_stl(Array2, sizeof(Array2) / sizeof(int));
return 0;
}
// 靜態(tài)函數(shù), 用于根據(jù)堆的性質(zhì)調(diào)整堆
static void adjust_heap(int *pFirst, int nHoleIndex, int nLen, int nValue);
// push_heap為向堆中添加一個(gè)新的元素, 調(diào)用這個(gè)算法的前提是[First, Last)之間的元素滿足堆的條件
// 新加入的元素為L(zhǎng)ast
void push_heap(int* pFirst, int* pLast)
{
int nTopIndex, nHoleIndex, nParentIndex;
int nValue;
nTopIndex = 0;
nHoleIndex = (int)(pLast - pFirst - 1);
nParentIndex = (nHoleIndex - 1) / 2;
nValue = *(pLast - 1);
// 如果需要插入的節(jié)點(diǎn)值比父節(jié)點(diǎn)大, 上溯繼續(xù)查找
while (nHoleIndex > nTopIndex && pFirst[nParentIndex] < nValue)
{
pFirst[nHoleIndex] = pFirst[nParentIndex];
nHoleIndex = nParentIndex;
nParentIndex = (nHoleIndex - 1) / 2;
}
pFirst[nHoleIndex] = nValue;
}
// pop_heap為從堆中刪除一個(gè)元素, 調(diào)用這個(gè)算法的前提是[First, Last)之間的元素滿足堆的條件
// 被刪除的元素被放置到Last - 1位置,由于這里是max-heap,所以被刪除的元素是這個(gè)序列中最大的元素
void pop_heap(int* pFirst, int* pLast)
{
int nValue;
nValue = *(pLast - 1);
*(pLast - 1) = *pFirst;
adjust_heap(pFirst, 0, (int)(pLast - pFirst - 1), nValue);
}
// make_heap將序列[First, Last)中的元素按照堆的性質(zhì)進(jìn)行重組
void make_heap(int* pFirst, int* pLast)
{
int nLen, nParentIndex;
nLen = (int)(pLast - pFirst);
nParentIndex = (nLen - 1) / 2;
while (true)
{
// 對(duì)父節(jié)點(diǎn)進(jìn)行調(diào)整, 把父節(jié)點(diǎn)的值調(diào)整到合適的位置
adjust_heap(pFirst, nParentIndex, nLen, pFirst[nParentIndex]);
if (0 == nParentIndex)
return;
nParentIndex--;
}
}
// 對(duì)堆進(jìn)行排序, 調(diào)用這個(gè)函數(shù)可以成功排序的前提是[pFirst, pLast)中的元素符合堆的性質(zhì)
void sort_heap(int* pFirst, int* pLast)
{
// 調(diào)用pop_heap函數(shù), 不斷的把當(dāng)前序列中最大的元素放在序列的最后
while(pLast - pFirst > 1)
pop_heap(pFirst, pLast--);
}
// 判斷一個(gè)序列[First, Last)是否滿足堆的條件,是就返回1,否則返回0
char is_heap(int* pFirst, int* pLast)
{
int nLen, nParentIndex, nChildIndex;
nLen = (int)(pLast - pFirst);
nParentIndex = 0;
for (nChildIndex = 1; nChildIndex < nLen; ++nChildIndex)
{
if (pFirst[nParentIndex] < pFirst[nChildIndex])
return 0;
// 當(dāng)nChildIndex是偶數(shù)時(shí), 那么父節(jié)點(diǎn)已經(jīng)和它的兩個(gè)子節(jié)點(diǎn)進(jìn)行過比較了
// 將父節(jié)點(diǎn)遞增1
if ((nChildIndex & 1) == 0)
++nParentIndex;
}
return 1;
}
// 一個(gè)靜態(tài)函數(shù)僅供adjust_heap調(diào)用以證實(shí)JJHOU的結(jié)論
static void push_heap(int *pFirst, int nHoleIndex, int nTopIndex, int nValue)
{
int nParentIndex;
nParentIndex = (nHoleIndex - 1) / 2;
while (nHoleIndex > nTopIndex && pFirst[nParentIndex] < nValue)
{
pFirst[nHoleIndex] = pFirst[nParentIndex];
nHoleIndex = nParentIndex;
nParentIndex = (nHoleIndex - 1) / 2;
}
pFirst[nHoleIndex] = nValue;
}
// 對(duì)堆進(jìn)行調(diào)整, 其中nHoleIndex是目前堆中有空洞的節(jié)點(diǎn)索引, nLen是待調(diào)整的序列長(zhǎng)度
// nValue是需要安插進(jìn)入堆中的值
static void adjust_heap(int *pFirst, int nHoleIndex, int nLen, int nValue)
{
int nTopIndex, nSecondChildIndex;
nTopIndex = nHoleIndex;
nSecondChildIndex = 2 * nTopIndex + 2;
while (nSecondChildIndex < nLen)
{
if (pFirst[nSecondChildIndex] < pFirst[nSecondChildIndex - 1])
--nSecondChildIndex;
pFirst[nHoleIndex] = pFirst[nSecondChildIndex];
nHoleIndex = nSecondChildIndex;
nSecondChildIndex = 2 * nHoleIndex + 2;
}
if (nSecondChildIndex == nLen)
{
pFirst[nHoleIndex] = pFirst[nSecondChildIndex - 1];
nHoleIndex = nSecondChildIndex - 1;
}
// 以下兩個(gè)操作在這個(gè)函數(shù)中的作用相同, 證實(shí)了<<STL源碼剖析>>中P178中JJHOU所言
//pFirst[nHoleIndex] = nValue;
push_heap(pFirst, nHoleIndex, nTopIndex, nValue);
}
void test_heap_algo(int *pArray, int nLength)
{
std::cout << "\ntest_heap_algo()\n";
make_heap(pArray, pArray + nLength);
display_array(pArray, nLength);
push_heap(pArray, pArray + nLength);
display_array(pArray, nLength);
pop_heap(pArray, pArray + nLength);
display_array(pArray, nLength);
if (is_heap(pArray, pArray + nLength - 1))
{
std::cout << "is heap!\n";
}
else
{
std::cout << "is not heap!\n";
}
make_heap(pArray, pArray + nLength);
display_array(pArray, nLength);
if (is_heap(pArray, pArray + nLength))
{
std::cout << "is heap!\n";
}
else
{
std::cout << "is not heap!\n";
}
sort_heap(pArray, pArray + nLength);
display_array(pArray, nLength);
}
void test_heap_algo_in_stl(int *pArray, int nLength)
{
std::cout << "\ntest_heap_algo_in_stl()\n";
std::make_heap(pArray, pArray + nLength);
display_array(pArray, nLength);
std::push_heap(pArray, pArray + nLength);
display_array(pArray, nLength);
std::pop_heap(pArray, pArray + nLength);
display_array(pArray, nLength);
// 注意is_heap不是STL中支持的算法, 貌似只有SGI的實(shí)現(xiàn)才有這個(gè)函數(shù)!
if (is_heap(pArray, pArray + nLength - 1))
{
std::cout << "is heap!\n";
}
else
{
std::cout << "is not heap!\n";
}
std::make_heap(pArray, pArray + nLength);
display_array(pArray, nLength);
if (is_heap(pArray, pArray + nLength))
{
std::cout << "is heap!\n";
}
else
{
std::cout << "is not heap!\n";
}
std::sort_heap(pArray, pArray + nLength);
display_array(pArray, nLength);
}
void display_array(int *pArray, int nLength)
{
for (int i = 0; i < nLength; ++i)
std::cout << pArray[i] << " ";
std::cout << std::endl;
}
