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 resuling 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 给定2个序列，一个是原始序列，一个是经过插入排序或堆排序之后的序列。判断并输出某个排序算法下一步之后的序列。
柿子挑软的捏。插入排序前面几个是有序的，从不满足有序的数字开始，和原序列比较，如果后面全部相同，则为插入排序，否则是堆排序。
如果是堆排序，那么从后往前是有序的，找到不有序的下标，对原始序列堆排序，直到那个下标。(牢记堆排序代码！！！)
#include<stdio.h> #include<stdlib.h> int comp(const void*a,const void*b){ return *(int*)a-*(int*)b; } void swap(int *a,int *b){ int temp=*a; *a=*b; *b=temp; } void percdown(int a[],int p,int n){ int parent,child; int temp=a[p]; for(parent=p;parent*2+1<n;parent=child){ child=parent*2+1; if(child!=n-1&&a[child+1]>a[child]){ child=child+1; } if(temp>=a[child]){ break; } a[parent]=a[child]; } a[parent]=temp; } int main(){ int n,i,j; scanf("%d",&n); int a[n],b[n]; for(i=0;i<n;i++){ scanf("%d",&a[i]); } for(i=0;i<n;i++){ scanf("%d",&b[i]); } int index; for(i=0;i<n-1;i++){ if(b[i]>b[i+1]){ index=i+1;break; } } int flag=1; for(i=index;i<n;i++){ if(a[i]!=b[i]){ flag=0;break; } } if(flag){ int temp; temp=b[index]; for(j=index;j>0&&b[j-1]>temp;j--){ b[j]=b[j-1]; } b[j]=temp; printf("Insertion Sort\n"); printf("%d",b[0]); for(i=1;i<n;i++){ printf(" %d",b[i]); } } else{ int c[n]; for(i=0;i<n;i++){ c[i]=a[i]; } qsort(c,n,sizeof(int),comp); for(i=n-1;i>=0;i--){//从后往前找 if(c[i]!=b[i]){ index=i;break; } } for(i=n/2-1;i>=0;i--){ percdown(a,i,n); } for(i=n-1;i>=index;i--){ swap(&a[0],&a[i]); percdown(a,0,i); } printf("Heap Sort\n"); printf("%d",a[0]); for(i=1;i<n;i++){ printf(" %d",a[i]); } } }
