zoukankan      html  css  js  c++  java
  • 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 (≤). 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

    考察插入和堆排序的判定

    #include <iostream>
    #include <algorithm>
    #include <vector>
    using namespace std;
    void downAdjust(vector<int> &b, int low, int high) {
        int i = 1, j = i * 2;
        while(j <= high) {
            if(j + 1 <= high && b[j] < b[j + 1]) j = j + 1;
            if (b[i] >= b[j]) break;
            swap(b[i], b[j]);
            i = j; j = i * 2;
        }
    }
    int main() {
        int n, p = 2;
        scanf("%d", &n);
        vector<int> a(n + 1), b(n + 1);
        for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
        for(int i = 1; i <= n; i++) scanf("%d", &b[i]);
        while(p <= n && b[p - 1] <= b[p]) p++;
        int index = p;
        while(p <= n && a[p] == b[p]) p++;
        if(p == n + 1) {
            printf("Insertion Sort
    ");
            sort(b.begin() + 1, b.begin() + index + 1);
        } else {
            printf("Heap Sort
    ");
            p = n;
            while(p > 2 && b[p] >= b[1]) p--;
            swap(b[1], b[p]);
            downAdjust(b, 1, p - 1);
        }
        printf("%d", b[1]);
        for(int i = 2; i <= n; i++)
            printf(" %d", b[i]);
        return 0;
    }
  • 相关阅读:
    windows下的文件遍历(使用CFindFile)
    hdu 1728 搜索求最少的转向次数
    linux中vsftpd配置文件详解
    QLineEdit 自动完成(使用setCompleter,内含一个ListView)
    Qt 的内部进程通信机制
    qt 获取windows 的消息(通过MFC的DLL的透明窗体转发消息)good
    JS的类型比较与转换图
    使用C#开发ActiveX控件
    MapXtreme+Asp.net 动态轨迹
    MS SQL 日常维护管理常用脚本(二)
  • 原文地址:https://www.cnblogs.com/littlepage/p/12905619.html
Copyright © 2011-2022 走看看