According to Wikipedia:
Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, insertion sort removes one element from the input data, finds the location it belongs within the sorted list, and inserts it there. It repeats until no input elements remain.
Heap sort divides its input into a sorted and an unsorted region, and it iteratively shrinks the unsorted region by extracting the largest element and moving that to the sorted region. it involves the use of a heap data structure rather than a linear-time search to find the maximum.
Now given the initial sequence of integers, together with a sequence which is a result of several iterations of some sorting method, can you tell which sorting method we are using?
Input Specification:
Each input file contains one test case. For each case, the first line gives a positive integer N (≤100). Then in the next line, N integers are given as the initial sequence. The last line contains the partially sorted sequence of the N numbers. It is assumed that the target sequence is always ascending. All the numbers in a line are separated by a space.
Output Specification:
For each test case, print in the first line either “Insertion Sort” or “Heap Sort” to indicate the method used to obtain the partial result. Then run this method for one more iteration and output in the second line the resulting sequence. It is guaranteed that the answer is unique for each test case. All the numbers in a line must be separated by a space, and there must be no extra space at the end of the line.
Sample Input 1:
10
3 1 2 8 7 5 9 4 6 0
1 2 3 7 8 5 9 4 6 0
Sample Output 1:
Insertion Sort
1 2 3 5 7 8 9 4 6 0
Sample Input 2:
10
3 1 2 8 7 5 9 4 6 0
6 4 5 1 0 3 2 7 8 9
Sample Output 2:
Heap Sort
5 4 3 1 0 2 6 7 8 9
题⽬⼤意:
给出n和n个数的序列a和b,a为原始序列,b为排序其中的⼀个步骤,问b是a经过了堆排序还是插⼊排序的,并且输出它的下⼀步
分析
写出插入排序和堆排序,检查每一步堆排序和插入排序序列是否与所给中间序列相等,如果相等则输出结果并终止函数,为了方便起见,将数组存放从1开始。
//1098 Insertion or Heap Sort (25分)
#include <iostream>
using namespace std;
int const maxn=105;
int n,heap[maxn],array[maxn],sorted[maxn];
void downAdjust(int low,int high)
{
int i=low,j=i*2;
while(j<=high)
{
if(j+1<=high&&heap[j+1]>heap[j])
{
j=j+1;
}
if(heap[j]>heap[i])
{
swap(heap[i],heap[j]);
i=j;
j=j*2;
}
else
break;
}
}
void createHeap()
{
for(int i=n/2; i>=1; i--)
{
downAdjust(i,n);
}
}
bool judge()
{
int flag=true;
for(int i=1; i<n; i++)
{
if(heap[i]!=sorted[i])
flag=false;
}
return flag;
}
bool judge2()
{
int flag2=true;
for(int i=1; i<n; i++)
{
if(array[i]!=sorted[i])
flag2=false;
}
return flag2;
}
void heapSort()
{
bool flag=false;
for(int i=n; i>1; i--)
{
if(judge())
{
cout<<"Heap Sort"<<endl;
flag=true;
}
swap(heap[1],heap[i]);
downAdjust(1,i-1);
if(flag)
{
for(int j=1; j<=n; j++)
if(j==1)
cout<<heap[j];
else
cout<<" "<<heap[j];
return ;
}
}
}
void insertSort()
{
int step=0;
for(int i=2; i<=n; i++)
{
int temp=array[i],j=i;
while(j>1&&temp<array[j-1])
{
array[j]=array[j-1];
j--;
}
array[j]=temp;
if(step==i)
{
cout<<"Insertion Sort"<<endl;
for(int k=1; k<=n; k++)
if(k==1)
cout<<array[k];
else
cout<<" "<<array[k];
return ;
}
if(judge2())
{
step=i+1;
}
}
}
int main()
{
cin>>n;
for(int i=1; i<=n; i++)
{
cin>>heap[i];
array[i]=heap[i];
}
for(int i=1; i<=n; i++)
{
cin>>sorted[i];
}
createHeap();
heapSort();
insertSort();
return 0;
}