数据结构函数题6.13

最新推荐文章于 2023-06-06 15:29:46 发布

我又_不乱来

最新推荐文章于 2023-06-06 15:29:46 发布

阅读量200

点赞数

本文链接：https://blog.csdn.net/weixin_48314398/article/details/111400067

版权

6-13 Percolate Up and Down (20分)

Write the routines to do a “percolate up” and a “percolate down” in a binary min-heap.

Format of functions:

void PercolateUp( int p, PriorityQueue H );
void PercolateDown( int p, PriorityQueue H );

where int p is the position of the element, and PriorityQueue is defined as the following:

typedef struct HeapStruct *PriorityQueue;
struct HeapStruct {
ElementType *Elements;
int Capacity;
int Size;
};

Sample program of judge:

#include <stdio.h>
#include <stdlib.h>

typedef int ElementType;
#define MinData -1

typedef struct HeapStruct *PriorityQueue;
struct HeapStruct {
    ElementType  *Elements;
    int Capacity;
    int Size;
};

PriorityQueue Initialize( int MaxElements ); /* details omitted */

void PercolateUp( int p, PriorityQueue H );
void PercolateDown( int p, PriorityQueue H );

void Insert( ElementType X, PriorityQueue H ) 
{
    int p = ++H->Size;
    H->Elements[p] = X;
    PercolateUp( p, H );
}

ElementType DeleteMin( PriorityQueue H ) 
{ 
    ElementType MinElement; 
    MinElement = H->Elements[1];
    H->Elements[1] = H->Elements[H->Size--];
    PercolateDown( 1, H );
    return MinElement; 
}

int main()
{
    int n, i, op, X;
    PriorityQueue H;

    scanf("%d", &n);
    H = Initialize(n);
    for ( i=0; i<n; i++ ) {
        scanf("%d", &op);
        switch( op ) {
        case 1:
            scanf("%d", &X);
            Insert(X, H);
            break;
        case 0:
            printf("%d ", DeleteMin(H));
            break;
        }
    }
    printf("\nInside H:");
    for ( i=1; i<=H->Size; i++ )
        printf(" %d", H->Elements[i]);
    return 0;
}

/* Your function will be put here */

void PercolateUp( int p, PriorityQueue H )
{
	while(1)
	{
		if(p/2&&H->Elements[p]<=H->Elements[p/2])
		{
			int d=H->Elements[p];
			H->Elements[p]=H->Elements[p/2];
			H->Elements[p/2]=d;
			p/=2;
		}
		else return;
	}
}
void PercolateDown( int p, PriorityQueue H )
{
	int t;
	while(1)
	{
		if(p*2<=H->Size&&H->Elements[p]>=H->Elements[p*2])
		t=p*2;
        else t=p;
		if(p*2+1<=H->Size&&H->Elements[t]>=H->Elements[p*2+1])
		t=p*2+1;
		if(p!=t)
		{
			int d=H->Elements[t];
			H->Elements[t]=H->Elements[p];
			H->Elements[p]=d;
			p=t;
		}
		else return ;
	}
}