1098. Insertion or Heap Sort (25)

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

/*
 * 这题思路比较简单：
 1.中间序列 前面有序  后面和原始序列相同  则为插入排序。
 2.堆排序  后面的数  应该是原数组中从大到小的数 如果遇到不满足这个条件的数  说明堆排序即将进行到当前这个数  
 在走一趟堆排序即可
*/
#include "iostream"
#include "algorithm"
using namespace std;bool judge(int a[],int b[],int n) { /* 判断是不是插入排序 */
    int len = 1;
    int i;
    for ( i = 0; i < n - 1; i++)
        if (b[i] > b[i + 1]) {
            len = i + 1;
            break;
        }
    for (i=len; i < n; i++) {
        if (a[i] != b[i])
            return false;
    }
    sort(b, b + len + 1);
    return true;
}
void print(int a[], int n) {
    for (int i = 0; i < n; i++) {
        if (i == 0)
            cout << a[i];
        else
            cout << " " << a[i];
    }
    cout << endl;
}
void adjust(int b[], int n) {
    int parent = 0;
    int child;
    int temp = b[parent];
    for (; parent * 2 + 1 <= n;parent = child) {
        child = parent * 2 + 1;
        if (child + 1 <= n && b[child + 1] > b[child])
            child = child + 1;
        if (b[child] <= temp)
            break;
        b[parent] = b[child];
    }
    b[parent] = temp;
}
int main() {
    int a[101], b[101];
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    for (int i = 0; i < n; i++) {
        cin >> b[i];
    }
    if (judge(a, b, n)) {
        cout << "Insertion Sort" << endl;
        print(b, n);
    }
    else {
        cout << "Heap Sort" << endl;
        int i;
        sort(a, a + n);
        for (i = n-1; i >= 0; i--) {
            if (a[i] != b[i])
                break;
        }
        int temp = b[0];
        b[0] = b[i];
        b[i] = temp;
        adjust(b,i-1); /* 剩下的元素调整为最大堆 */
        print(b, n);
    }
}

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