다음 코드는 C언어로 구현한 힙정렬 소스입니다. #include // Function to swap two elements void swap(int* a, int* b) { int temp = *a; *a = *b; *b = temp; } // Heapify the subtree rooted at index 'root' void heapify(int arr[], int size, int root) { int largest = root; // Initialize largest as root int left = 2 * root + 1; // Left child int right = 2 * root + 2; // Right child // If left child is larger than root if (l..