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. At 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
    #include<cstdio>
    #include<algorithm>
    using namespace std;
    const int N = 110;
    int origin[N],tempOri[N],changed[N];
    int n;
    
    bool showArray(int A[]){   //1
        for(int i = 1; i <= n; i++){
            printf("%d",A[i]);   //2
            if(i < n) printf(" ");
        }
        printf("
    ");
    }
    
    bool isSame(int A[],int B[]){
        for(int i = 1; i <= n; i++){
            if(A[i] != B[i]) return false;
        }
        return true;
    }
    
    bool insertSort(){
        bool flag = false;
        for(int i = 2; i <= n; i++){  //3
            if(i != 2 && isSame(tempOri,changed)){ //4
                flag = true;
            }
            sort(tempOri,tempOri+i+1);  //5
            if(flag == true){
                return true;
            }
        }
        return false;
    }
    
    void downAdjust(int low,int high){
        int i = low, j = i*2;
        while(j <= high){
            if(j < high && tempOri[j] < tempOri[j+1]){
            j = j+1; 
        }
        if(tempOri[i] < tempOri[j]){
            swap(tempOri[i],tempOri[j]);
            i = j;
            j = j*2;
        }else{
            break;
        }
     }
    }
    
    void heap(){
        bool flag = false;
        for(int i = n/2; i >=1; i--){
            downAdjust(i,n);
        }
        for(int i = n; i > 1; i--){
            if(i != n && isSame(tempOri,changed)){
                flag = true;
            }
            swap(tempOri[i],tempOri[1]);
            downAdjust(1,i-1);
        if(flag == true){
        showArray(tempOri);
        return;  //7
      }
        }
    
    }
    
    int main(){
        scanf("%d",&n);
        for(int i = 1; i <= n; i++){
            scanf("%d",&origin[i]);
            tempOri[i] = origin[i];
        }
        for(int i = 1; i <= n; i++){
            scanf("%d",&changed[i]);
        }
        if(insertSort()){
            printf("Insertion Sort
    ");
            showArray(tempOri);
        }else{
            printf("Heap Sort
    ");
            for(int i = 1; i <= n; i++){
                tempOri[i] = origin[i];
            }
            heap();
        }
        return 0;
    }
  • 相关阅读:
    常用正则表达式
    C# 计算时间差 用timespan函数
    SQL Server日期时间格式转换字符串详解
    .net数据根据字段进行分类(linq语句)
    IIS设置允许下载.exe文件解决方法
    IIS 添加mime 支持 apk,exe,.woff,IIS MIME设置 ,Android apk下载的MIME 设置 苹果ISO .ipa下载mime 设置
    高版本jQuery设置checkbox状态注意事项
    sql大小转换函数
    常用的正则验证
    position布局影响点击事件以及冒泡获取事件目标
  • 原文地址:https://www.cnblogs.com/wanghao-boke/p/9314365.html
Copyright © 2011-2022 走看看