堆合并算法实现与性能分析.pdfVIP

Chapter1:Introduction

Theproblemrequiresustoimplementmergeoperationonbinaryheap,leftist

heapandskewheap,andthenmeasureandanalyzetherunningtimeofmergeoperation

ondifferentheaps.

Chapter2:AlgorithmSpecification

Mergeoperationonbinaryheaps:

SupposethatwearegoingtomergeB1andB2,wecanfirstlycombingthetwo

arraydirectly,andthenusebuild_heapfunctionintroducedinthetextbook.

Pseudocode:

for(i=M+1;i=M+N;i++)//conbinethetwoarraysoftwoheaps,andstoreitinB2

{

B2-Elements[i]=B1-Elements[i-M];

}

B2-Size=M+N;

Build(B2);//buildupthenewheap

Mergeoperationonleftistheaps:

SupposethatwearegoingtomergeL1andL2,wecanimplementitrecursively.

Firstly,weuseswappingtomakesurethattheheapwithsmallerrootisL1.Thenwe

keeptheleftchildtreeofL1,andmergetherightchildtreeofL1withL2,andmake

thenewtreetherightchildofL2.Inthisprocess,wemakesurethatineverynode,the

nplofleftchildisnosthanthatofrightchild,otherwiseweswapthetwochildren.

Pseudocode:

LHeapMerge(LHeapH1,LHeapH2)//MergeH1andH2

{

if(H1==NULL)

returnH2;

if(H2==NULL)

returnH1;

if(H1-ElementH2-Element)//makesurethattheheapwithsmallerrootisontheleft

returnMerge1(H1,H2);

else

returnMerge1(H2,H1);

}

staticLHeap

Merge1(LHeapH1,LHeapH2)

{

LHeapMerge(LHeapH1,LHeapH2);

if(H1-Left==NULL)/*Singlenode*/

第一章：简介

该问题要求我们对二叉堆、左移堆和倾斜堆进行合并操作，然后测量和分

析不同堆上合并操作的运行时间。

第2章：算范

二叉堆上的合并操作：

假设我们要合并B1和B2，我们可以先直接合并两个数组，然后使用上介绍的

_

build堆函数。

伪代码：

for(i=M+1;i=M+N;i++)//将两个堆的两个数组合并，存入B2{B2‑

Elements[i]=B1‑Elements[i‑M];}B2‑尺寸=M+N；Build(B2);//构建新堆

左堆上的合并操作：

假设我们要合并L1和L2，我们可以递归地实现。首先，我们使用交换来确

保根较小