关于堆排序,其实是模拟二叉树,因为要保证父节点的值大于子结点的值,在这之中,有一些函数,首先是downAdjujst(low,high),是不能确定low结点的值是不是从low-high中数的最大值,所以需要进行调整,就是父节点和子节点进行比较,比较好了如果子节点大于父结点就进行交换,然后还有一个函数是刚开始建堆的时候,从n/2到0,都需要做比较,让他称为真正的堆。
#include <stdio.h>
#include <iostream>
#include <algorithm>
#pragma warning(disable:4996);
using namespace std;
const int maxn = 110;
int n;
int Aftersort[maxn];
int heap[maxn];
int insertArr[maxn];
bool arrayEqual(int a[], int b[])
{
for (int i = 1; i <= n; i++)
{
if (a[i] != b[i])
{
return false;
}
}
return true;
}
void downAdjust(int low, int high)
{
int k = low * 2;
while (k <= high)
{
if (k+1 <= high && heap[k] < heap[k + 1])
{
k = k + 1;
}
if (heap[low] < heap[k])
{
swap(heap[low], heap[k]);
low = k;
k = low * 2;
}
else {
break;
}
}
}
void buildHeap()
{
for (int i = n / 2; i >= 1; i--)
{
downAdjust(i, n);
}
}
bool heapSort()
{
buildHeap();
bool flag = false;
for (int i = n; i > 1; i--)
{
swap(heap[1], heap[i]);
downAdjust(1, i-1);
if (flag == true)
{
return true;
}
flag = arrayEqual(heap, Aftersort);
}
return false;
}
bool insertSort()
{
bool flag = false;
for (int i = 3; i <= n+1; i++)
{
sort(insertArr + 1, insertArr + i);
if (flag == true)
{
return true;
}
flag = arrayEqual(insertArr, Aftersort);
}
return false;
}
void ShowArr(int a[])
{
printf("%d", a[1]);
for (int i = 2; i <= n; i++)
{
printf(" %d",a[i]);
}
}
int main()
{
scanf("%d", &n);
for (int i = 1; i <= n; i++)
{
scanf("%d", &heap[i]);
insertArr[i] = heap[i];
}
for (int i = 1; i <= n; i++)
{
scanf("%d", &Aftersort[i]);
}
if (insertSort() == true)
{
printf("Insertion Sort\n");
ShowArr(insertArr);
}
else if (heapSort() == true)
{
printf("Heap Sort\n");
ShowArr(heap);
}
}