zoukankan      html  css  js  c++  java
  • 09-排序3 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 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 <stdio.h>
    #include <stdbool.h>
    
    #define MAXSIZE 100
    
    void InsertSort(int A[], int N);
    void HeapSort(int A[], int N);
    void PercDown(int A[], int N, int p);
    
    bool IsSame(int A[], int B[], int N);
    void Print(int A[], int N);
    
    int B[MAXSIZE];
    
    int main() {
        int N, A[MAXSIZE];
        scanf("%d", &N);
        for (int i = 0; i < N; i++)
            scanf("%d", &A[i]);
        for (int i = 0; i < N; i++)
            scanf("%d", &B[i]);
    
        int insert_A[MAXSIZE], heap_A[MAXSIZE];
        for (int i = 0; i < N; i++) {
            insert_A[i] = A[i];
            heap_A[i] = A[i];
        }
    
        InsertSort(insert_A, N);
        HeapSort(heap_A, N);
    
        return 0;
    }
    
    void InsertSort(int A[], int N) {
        int temp, i, j; 
        for (i = 1; i < N; i++) {
            temp = A[i];
            for (j = i - 1; j >= 0 && A[j] > temp; j--)
                A[j + 1] = A[j];
            A[j + 1] = temp;
    
            if (IsSame(A, B, N)) {
                temp = A[++i];
                for (j = i - 1; j >= 0 && A[j] > temp; j--)
                    A[j + 1] = A[j];
                A[j + 1] = temp;
    
                printf("Insertion Sort
    ");
                Print(A, N);
                return;
            }
        } 
    }
    
    void HeapSort(int A[], int N) {
        for (int p = N / 2 - 1; p >= 0; p--)
            PercDown(A, N, p);
        for (int i = N - 1; i > 0; i--) {
            int temp = A[i];
            A[i] = A[0];
            A[0] = temp;
    
            PercDown(A, i, 0);
    
            if (IsSame(A, B, N)) {
                temp = A[--i];
                A[i] = A[0];
                A[0] = temp;
                PercDown(A, i, 0);
    
                printf("Heap Sort
    ");
                Print(A, N);
                return;
            }
        }
    }
    
    void PercDown(int A[], int N, int p) {
        int parent, child;
        int temp = A[p];
        for (parent = p; 2 * parent + 1 < N; parent = child) {
            child = 2 * parent + 1;
            if (child + 1 < N && A[child + 1] > A[child])
                child++;
            if (temp < A[child])
                A[parent] = A[child];
            else
                break;
        }
        A[parent] = temp;
    }
    
    bool IsSame(int A[], int B[], int N) {
        for (int i = 0; i < N; i++) {
            if (A[i] != B[i])
                return false;
        }
        return true;
    }
    
    void Print(int A[], int N) {
        printf("%d", A[0]);
        for (int i = 1; i < N; i++) {
            printf(" %d", A[i]);
        }
        printf("
    ");
    }
    
  • 相关阅读:
    monogobd 查询语句
    node express 使用中间件multer实现文件上传
    express+monogodb+前台react JSX模板引擎相关配置(非webapck)服务端渲染
    uniapp项目实战 新闻类app
    react+express项目创建JSX模板方式
    express+monogodb实现增删改查
    uniapp 云函数批量导出功能实现及api方法封装
    uniapp自定义顶部搜索框兼容微信小程序
    MySQL-OnlineDDL在线DDL
    子查询优化
  • 原文地址:https://www.cnblogs.com/AndyHY-Notes/p/12711505.html
Copyright © 2011-2022 走看看