堆的创建、插入、删除、排序

#pragma once
#include <iostream>
using namespace std;
class MaxHeap {
private:
	int * harr;
	int capacity;
	int size;
public:
	MaxHeap(int cap);
	~MaxHeap();
	int parent(int i);
	int left(int i);
	int right(int i);
	void sift_Up(int * harr,int i);
	void sift_Down(int * harr,int i);
	void insertKey(int x);
	void deleteKey(int i);
	void makeHeap(int * arr,int n);
	void heapSort(int * arr,int n);
	void adjustHeap(int * arr, int i, int length);
	void print();
};
MaxHeap::MaxHeap(int cap) {
	capacity = cap;
	size = 0;
	harr = new int[cap];
}
MaxHeap::~MaxHeap() {
	delete[]harr;
	capacity = 0;
	size = 0;
}
int MaxHeap::parent(int i) {
	return i / 2;
}
int MaxHeap::left(int i) {
	return 2 * i;
}
int MaxHeap::right(int i) {
	return 2 * i + 1;
}
void MaxHeap::sift_Up(int * harr,int i) {
	int temp;
	while (i >= 1) {
		if (harr[i] > harr[parent(i)]) {
			temp = harr[i];
			harr[i] = harr[parent(i)];
			harr[parent(i)] = temp;
			i = i / 2;
		}
		else {
			break;
		}
	}
}
void MaxHeap::sift_Down(int * harr,int i) {
	int temp;
	while (2 * i + 1 < size) {
		i = 2 * i;
		if (i+1 <= size-1&&harr[i+1] > harr[i]) {
			i = i + 1;
		}
		if (harr[i/2] < harr[i]) {
			temp = harr[i];
			harr[i] = harr[i/2];
			harr[i/2] = temp;
		}
		else {
			break;
		}
	}
}
void MaxHeap::insertKey(int x) {
	size = size + 1;
	harr[size - 1] = x;
	sift_Up(harr,size - 1);
}
void MaxHeap::deleteKey(int i) { 
	int x = harr[i];
	int y = harr[size - 1];
	size = size - 1;
	if (i == size + 1) {
		return;
	}
	harr[i] = y;
	if (harr[y] >= harr[x]) {
		sift_Up(harr,i);
	}
	else {
		sift_Down(harr, i);
	}
}
void MaxHeap::heapSort(int * arr,int n) {    //降序排列
	int temp;
	makeHeap(arr, n);
	for (int i = n - 1; i > 0; i--) {
		temp = arr[i];
		arr[i] = arr[0];
		arr[0] = temp;
		adjustHeap(arr, 0, i);
	}
}
void MaxHeap::print() {  //打印堆
	for (int i = 0; i < size; i++) {
		cout << harr[i] << " ";
	}
}
void print(int * arr,int n) { //打印数组
	for (int i = 0; i < n; i++) {
		cout << arr[i] << " ";
	}
}
void MaxHeap::makeHeap(int * arr, int n) { //将数组调整为堆
	for (int i = n / 2 - 1; i >= 0; i--) {
		sift_Down(arr, i);
	}
}
void MaxHeap::adjustHeap(int * arr, int i, int length) {
	int temp = arr[i];//先取出当前元素i
	for (int k = i * 2 + 1; k<length; k = k * 2 + 1) {//从i结点的左子结点开始，也就是2i+1处开始
		if (k + 1<length && arr[k]<arr[k + 1]) {//如果左子结点小于右子结点，k指向右子结点
			k++;
		}
		if (arr[k] >temp) {//如果子节点大于父节点，将子节点值赋给父节点（不用进行交换）
			arr[i] = arr[k];
			i = k;
		}
		else {
			break;
		}
	}
	arr[i] = temp;//将temp值放到最终的位置
}