C++ 힙정렬 구현

1 개요

C++ 힙정렬 구현

#include <iostream>
void heap_heapify(int a[], int size, int i) {
	int left=2*i+1, right=2*i+2, largest=i;
	if( left<size && a[left]>a[largest] ) largest=left;
	if( right<size && a[right]>a[largest] ) largest=right;
	if( largest == i ) return;
	std::swap(a[i], a[largest]);
	heap_heapify(a, size, largest);
}
void heap_sort(int a[], int size) {
	for(int i=size/2-1; i>=0; i--) heap_heapify(a, size, i);
	for(int i=size-1; i>=0; i--) {
		std::swap(a[0], a[i]);
		heap_heapify(a, i, 0);
	}
}
int main() {
	int arr[] = {9,1,22,4,0,-1,1,22,100,10};
	heap_sort(arr, sizeof(arr)/sizeof(int));
	for(int x: arr) std::cout << x << " ";
	// -1 0 1 1 4 9 10 22 22 100 
}

2 같이 보기

• 힙정렬
• 힙정렬 구현