/*堆排序
*堆排序是一种高效重要的排序方法。它的时间复杂度可以达到O(nlogn)。
*原理:首先我们得到一个大根堆, 然后从堆的最后一个元素开始,依次往前遍历,每次首先将堆顶元素和当前元素进行交换,交换后再对新的堆顶做一个自上而下的堆调整。
*/
#include<iostream>
using namespace std;
class Heap {
private:
int *data, size;
public:
Heap(int length_input) {
data = new int[length_input];
size = 0;
}
~Heap() {
delete[] data;
}
void push(int value) {
data[size] = value;
int current = size;
int father = (current - 1) / 2;
while (data[current] > data[father]) {
swap(data[current], data[father]);
current = father;
father = (current - 1) / 2;
}
size++;
}
void output() {
for (int i = 0; i < size; i++) {
cout << data[i] << " ";
}
cout << endl;
}
int top() {
return data[0];
}
void update(int pos, int n) {
int lchild = 2 * pos + 1, rchild = 2 * pos + 2;
int max_value = pos;
if (lchild < n && data[lchild] > data[max_value]) {
max_value = lchild;
}
if (rchild < n && data[rchild] > data[max_value]) {
max_value = rchild;
}
if (max_value != pos) {
swap(data[pos], data[max_value]);
update(max_value, n);
}
}
void pop() {
swap(data[0], data[size - 1]);
size--;
update(0, size);
}
void heap_sort() {
for(int i=size-1; i>=1; i--) {
swap(data[i], data[0]);
update(0, i);//完成[0,i)的自上而下的调整
}
}
};
int main() {
int arr[10] = { 12, 9, 30, 24, 30, 4, 55, 64, 22, 37 };
Heap heap(100);
for (int i = 0; i < 10; i++) {
heap.push(arr[i]);
}
heap.output();
cout << heap.top() << endl;
heap.pop();
heap.output();
heap.heap_sort();
heap.output();
return 0;
}
*堆排序是一种高效重要的排序方法。它的时间复杂度可以达到O(nlogn)。
*原理:首先我们得到一个大根堆, 然后从堆的最后一个元素开始,依次往前遍历,每次首先将堆顶元素和当前元素进行交换,交换后再对新的堆顶做一个自上而下的堆调整。
*/
#include<iostream>
using namespace std;
class Heap {
private:
int *data, size;
public:
Heap(int length_input) {
data = new int[length_input];
size = 0;
}
~Heap() {
delete[] data;
}
void push(int value) {
data[size] = value;
int current = size;
int father = (current - 1) / 2;
while (data[current] > data[father]) {
swap(data[current], data[father]);
current = father;
father = (current - 1) / 2;
}
size++;
}
void output() {
for (int i = 0; i < size; i++) {
cout << data[i] << " ";
}
cout << endl;
}
int top() {
return data[0];
}
void update(int pos, int n) {
int lchild = 2 * pos + 1, rchild = 2 * pos + 2;
int max_value = pos;
if (lchild < n && data[lchild] > data[max_value]) {
max_value = lchild;
}
if (rchild < n && data[rchild] > data[max_value]) {
max_value = rchild;
}
if (max_value != pos) {
swap(data[pos], data[max_value]);
update(max_value, n);
}
}
void pop() {
swap(data[0], data[size - 1]);
size--;
update(0, size);
}
void heap_sort() {
for(int i=size-1; i>=1; i--) {
swap(data[i], data[0]);
update(0, i);//完成[0,i)的自上而下的调整
}
}
};
int main() {
int arr[10] = { 12, 9, 30, 24, 30, 4, 55, 64, 22, 37 };
Heap heap(100);
for (int i = 0; i < 10; i++) {
heap.push(arr[i]);
}
heap.output();
cout << heap.top() << endl;
heap.pop();
heap.output();
heap.heap_sort();
heap.output();
return 0;
}