调整堆的程序

来源：互联网发布：国元 8月宏观数据点评编辑：程序博客网时间：2024/06/16 07:59

//调整堆
void HeapAdjust(int a[], int root, int j); //root是根的下标,j是堆最后一个元素的数组下标，数组存储完全二叉树

void HeapAdjust_improve(int a[], int root, int j); //root是根的下标,j是堆最后一个元素的数组下标，数组存储完全二叉树

void main()

{

int a[8] = {65, 76, 13, 49, 49, 97, 27, 38};
for( int i = 3; i >= 0; --i ){
HeapAdjust_improve(a, i, 7);
for( auto f : a )
cout << f << " ";
cout << endl;
}

}

void HeapAdjust(int a[], int root, int j) //root是根的下标,j是堆最后一个元素的数组下标，数组存储完全二叉树,最小堆
{
int rc = a[root]; //parent = root, leftchild = 2 * root + 1, rightchild = 2 * root +2

for( int i = 2 * root + 1; i <= j; i = 2 * i + 1 )
{
if( i < j && a[i] > a[i+1] ) ++i;
if( a[root] > a[i] )
{
a[root] ^= a[i];
a[i] ^= a[root];
a[root] ^= a[i];
root = i;
}
else
break;
}
}

void HeapAdjust_improve(int a[], int root, int j)
{
int rc = a[root]; //parent = root, leftchild = 2 * root + 1, rightchild = 2 * root +2

for( int i = 2 * root + 1; i <= j; i = 2 * i + 1 )
{
if( i < j && a[i] > a[i+1] ) ++i;
if( rc > a[i] )
{
a[root] = a[i];
root = i;
}
else
break;
}

a[root] = rc;
}

0 0