heap_sort

heap_sort

#define _CRT_SECURE_NO_WARNINGS 1
#include <iostream>

using namespace std;

//circulation heapify
void heapify(int *a,int f,int b) {
	int l = f * 2 + 1;
	int r = l + 1;

	while(l<=b){
		int max;
		if (r > b)
			max = l;
		else
			max = a[l]> a[r] ? l : r;

		if (a[max] > a[f]) {
			a[max] = a[max] + a[f];
			a[f] = a[max] - a[f];
			a[max] = a[max] - a[f];
		}
		else
			return;
		f = max;
		l = f * 2 + 1;
		r = l + 1;
	}
}

void heap_sort(int* a, int b) {
	if (b < 1)
		return;
	//init_heap
	for (int i = (b - 1)/2; i >= 0; i--)
		heapify(a,i,b);

	for(int i=b;i>0;i--){
		a[0] = a[0] + a[i];
		a[i] = a[0] - a[i];
		a[0] = a[0] - a[i];
		heapify(a, 0, i-1);
	}
}

int main(){ 
	int a[] = { 44,3,38,5,47,15,36,26 ,27,2,46,4,19,50,48 };
	heap_sort(a, sizeof(a)/sizeof(a[0])-1);
	for (const auto& e : a)
		cout << e << " ";
	cout << endl;
	return 0;
}

/*
//recursion heapify2
void heapify2(int *a,int d,int b) {
	int f = d;
	int l = f * 2 + 1;
	int r = l + 1;
	if (l > b)
		return;
	int max;
	if (r > b)
		max = l;
	else
		max = a[l] > a[r] ? l : r;

	if (a[max] > a[f]) {
		int t = a[f];
		a[f] = a[max];
		a[max] = t;
	}
	else
		return;
	heapify2(a, max, b);
}
*/