zoukankan      html  css  js  c++  java
  • PAT 1098

    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 <bits/stdc++.h>
    using namespace std;
    #define N 120
    int  n,a[N],b[N],heap[N];
    int  flag  = 0;
    bool same(int *a,int *b){
        for(int i=1;i<=n;i++) {
            if(a[i]!=b[i]) return  false;
        }
        return  true;
    }
    void insert_sort(int *a){
        for(int i =2;i<=n;i++){//2不是1,因为堆排序输入的可能也是第一次排好的 
            sort(a+1,a+i+1);
            if(flag!=0) break;
            if(same(a,b)) flag  =1;
        }
    }
    void downjust(int l,int h){
        int i =l;
        int j =2*i;
        while(j<=h){
            if(j+1<=h&&heap[j]<heap[j+1]){
                j=j+1;
            }
            if(heap[j]>heap[i]){
                swap(heap[i],heap[j]);
                i=j;
                j=2*i;
            }
            else
            break;
        }
    }
    void create(int *a){
        for(int i =n/2;i>=1;i--){
            downjust(i,n);
        }
    }
    void heap_sort(int *a){
        for(int i=n;i>1;i--){
            swap(heap[i],heap[1]);
            downjust(1,i-1);
            if(flag!=0) break;
            if(same(heap,b)) flag  =2;
        }
    } 
    int main(){
        scanf("%d",&n);
        for(int i =1;i<=n;i++) 
        {
        scanf("%d",&a[i]);
        heap[i] = a[i]    ;
    }
    for(int  i=1;i<=n;i++){
        scanf("%d",&b[i]);
    }
    insert_sort(a);
    create(heap);
    heap_sort(heap);//heap 
    if(flag==1){
        printf("Insertion Sort
    ");
        for(int  i =1;i<=n;i++) {
            printf("%d%c",a[i],i==n?'
    ':' ');
        }
    }
    else if(flag  ==2){
        printf("Heap Sort
    ");
        for(int  i =1;i<=n;i++) {
            printf("%d%c",heap[i],i==n?'
    ':' ');
        }
    }
        return 0;
    }
  • 相关阅读:
    lucene 大量数据搜索的处理方案
    PC总线带宽与内存带宽的计算
    【JavaP6大纲】Dubbo篇:Dubbo特性?
    【JavaP6大纲】Dubbo篇:Dubbo 支持哪些序列化协议?说一下 Hessian 的数据结构?PB 知道吗?为什么 PB 的效率是最高的?
    【JavaP6大纲】Dubbo篇:如何自己设计一个类似 Dubbo 的 RPC 框架?
    【JavaP6大纲】Dubbo篇:Dubbo SPI 和 Java SPI 区别?
    【JavaP6大纲】Dubbo篇:如何基于 Dubbo 进行服务治理、服务降级、失败重试以及超时重试?
    【JavaP6大纲】Dubbo篇:Dubbo 用到哪些设计模式?
    【JavaP6大纲】Dubbo篇:Dubbo 负载均衡策略和集群容错策略都有哪些?动态代理策略呢?
    【JavaP6大纲】MySQL篇:传播行为
  • 原文地址:https://www.cnblogs.com/tingtin/p/11547887.html
Copyright © 2011-2022 走看看