【数据结构】-初阶-堆

Heap.h

typedef int  HPDataType;

typedef struct Heap
{
   
	HPDataType* _a;
	int _size;
	int _capacity;
}Heap;

void HeapCreate(Heap* hp, HPDataType* a, int n);

void HeapDestory(Heap* hp);
void HeapPush(Heap* hp, HPDataType x);
void HeapPop(Heap* hp);
void AdjustUp(int * a, int n, int child);
void HpPrint(Heap* hp);
HPDataType HeapTop(Heap* hp);
int HeapSize(Heap* hp);
int HeapEmpty(Heap* hp);
void AdjustDown(int * a, int n, int parent);

void HeapSort(int*a, int n);

int * getLeastNumbers(int *a, int arrSize, int k);

void PrintTopK(int * a, int n);

Heap.c

void Swap(int * p1, int* p2)
{
   
	int tmp = *p1;
	*p1= *p2;
	*p2 = tmp;
	
}

void AdjustDown(int* a, int n, int parent)
{
   
	int child = parent * 2 + 1;
	while