【PAT】A1098 Insertion or Heap Sort (25point(s))

Author: CHEN, Yue
Organization: 浙江大学
Time Limit: 400 ms
Memory Limit: 64 MB
Code Size Limit: 16 KB

A1098 Insertion or Heap Sort (25point(s))

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

Code

#include <bits/stdc++.h>
using namespace std;
vector<int> heap,sorted,temp;
void downAdjust(int root,int last){	// 向下调整（大顶堆情况）
    int i=root,j=i*2;
    while(j<=last){
        if(j+1<=last&&heap[j]<heap[j+1])    j=j+1;
        if(heap[i]<heap[j]){
            swap(heap[i],heap[j]);
            i=j;
            j=i*2;
        }
        else    break;
    }
}
int main(){
    int n, flag=0;
    cin>>n;
    heap.resize(n+1);
    sorted.resize(n+1);
    for(int i=1;i<=n;i++)   cin>>heap[i];
    for(int i=1;i<=n;i++)   cin>>sorted[i];
    for(int i=n/2;i>=1;i--) downAdjust(i,n);    // buildHeap，建堆
    for(int i=n;i>1;i--){
        swap(heap[i],heap[1]);
        downAdjust(1,i-1);
        if(heap==sorted){	// 找到与部分排序相等的序列
            flag=1;
            continue;		// 再进行一趟堆排
        }
        if(flag==1) break;
    }
    if(flag==0){
        printf("Insertion Sort\n");
        for(int i=2;i<=n;i++){
            if(sorted[i]<sorted[i-1]){
                sort(sorted.begin()+1,sorted.begin()+i+1);
                break;
            }
        }
        for(int i=1;i<=n;i++){
            if(i==1)    printf("%d",sorted[i]);
            else    printf(" %d",sorted[i]);
        }
    }
    else{
        printf("Heap Sort\n");
        for(int i=1;i<=n;i++){
            if(i==1)    printf("%d",heap[i]);
            else    printf(" %d",heap[i]);
        }
    }
	return 0;
}

Analysis

-给出一个初始序列与一个部分排序序列，判断部分排序序列是初始序列经过插入排序还是经过堆排生成的。

-有两种思路：
思路一：（我当时想到的）
将初始序列进行堆排序，每排序完一趟，就和部分排序序列比较，出现相同则说明是经过堆排产生的。
思路二：（更易）
如果部分排序序列是通过插入排序得到的，则只要遍历一下前面几位，遇到不是从小到大的时候，开始看部分排序序列和初始序列是不是对应位置的值相等，相等就说明是插入排序，否则就是堆排序。