C++代码
void MaxHeadAdjust(int A[], int k, int len)
{
A[0] = A[k];
for (int i = 2 * k; i <= len; i *= 2)
{
if (i < len && A[i] < A[i + 1])
i++;
if (A[0] >= A[i])
break;
else {
A[k] = A[i];
k = i;
}
}
A[k] = A[0];
}void MinHeadAdjust(int A[], int k, int len)
{
A[0] = A[k];
for (int i = 2 * k; i <= len; i *= 2)
{
if (i < len && A[i] > A[i + 1])
i++;
if (A[0] <= A[i])
break;
else {
A[k] = A[i];
k = i;
}
}
A[k] = A[0];
}
void BuildMaxHeap(int A[], int len)
{
for (int i = len / 2; i > 0; i--)
MaxHeadAdjust(A, i, len);
}
void BuildMinHeap(int A[], int len)
{
for (int i = len / 2; i > 0; i--)
MinHeadAdjust(A, i, len);
}
void MinHeapSort(int A[], int len)
{
BuildMinHeap(A, len);
for (int i = len; i > 1; i--)
{
swap(A[i], A[1]);
MinHeadAdjust(A, 1, i - 1);
}
}
void MaxHeapSort(int A[], int len)
{
BuildMaxHeap(A, len);
for (int i = len; i > 1; i--)
{
swap(A[i], A[1]);
MaxHeadAdjust(A, 1, i - 1);
}
}
int main()
{
int n,m,length=0;
int s[10];
cin >> n;
for (int i = 1; i < n+1; i++)
{
cin >> m;
s[i] = m;
length++;
}
//BuildMaxHeap(s, length);
MaxHeapSort(s, length);
cout << "大根堆排序" << endl;
for (int i = 1; i < n+1; i++)
{
cout << s[i] << " ";
}
cout << endl;
MinHeapSort(s, length);
cout << "小根堆排序" << endl;
//BuildMinHeap(s, length);
for (int i = 1; i < n + 1; i++)
{
cout << s[i] << " ";
}
cout << endl;
}