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

堆排序:https://www.cnblogs.com/chengxiao/p/6129630.html分析:https://blog.csdn.net/liuchuo/article/details/52252172代码:
 1 #include <bits/stdc++.h>
 2 using namespace std;
 3
 4 void adjust(int v[], int s, int e)
 5 {
 6     int cur = 1;
 7     while (1)
 8     {
 9         int l = cur << 1, r = cur << 1 | 1;
10         if (l <= e && r <= e)
11         {
12             if (v[l] < v[r])
13                 swap(v[cur], v[r]), cur = r;
14             else swap(v[cur], v[l]), cur = l;
15         }
16         else if (l <= e && r > e)
17             swap(v[cur], v[l]), cur = l;
18         else break;
19
20     }
21 }
22
23 int main()
24 {
25     int n;
26     int a[110], b[110];
27     cin >> n;
28     for (int i = 1; i <= n; i++)
29         cin >> a[i];
30     for (int i = 1; i <= n; i++)
31         cin >> b[i];
32     int pos = 1;
33     for (; pos + 1 <= n && b[pos] <= b[pos + 1]; pos++)
34         ;
35     int flag = 0;
36     for(int i = pos + 1; i <= n; i++)
37         if (a[i] != b[i])
38         {
39             flag = 1;
40             break;
41         }
42     if (!flag)
43     {
44         cout << "Insertion Sort" << endl;
45         sort(b + 1, b + 1 + pos + 1);
46         for (int i = 1; i <= n; i++)
47             printf("%d%c", b[i], i == n ? ‘\n‘ : ‘ ‘);
48     }
49     else
50     {
51         cout << "Heap Sort" << endl;
52         int pos = n;
53         for (; pos >= 1 && b[pos] >= b[1]; pos--);
54         swap(b[1], b[pos]); pos--;
55         adjust(b, 1, pos);
56         for (int i = 1; i <= n; i++)
57             printf("%d%c", b[i], i == n ? ‘\n‘ : ‘ ‘);
58     }
59 }

原文地址:https://www.cnblogs.com/liuwenhan/p/11823076.html

时间: 2024-10-08 06:59:38

1098 Insertion or Heap Sort (25 分)的相关文章

【PAT甲级】1098 Insertion or Heap Sort (25 分)

题意: 输入一个正整数N(<=100),接着输入两行N个数,表示原数组和经过一定次数排序后的数组.判断是经过插入排序还是堆排序并输出再次经过该排序后的数组(数据保证答案唯一). AAAAAccepted code: 1 #define HAVE_STRUCT_TIMESPEC 2 #include<bits/stdc++.h> 3 using namespace std; 4 int a[107],b[107]; 5 int c[107][5]; 6 int main(){ 7 ios:

PTA 09-排序3 Insertion or Heap Sort (25分)

题目地址 https://pta.patest.cn/pta/test/16/exam/4/question/676 5-14 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 s

1098. Insertion or Heap Sort (25)【排序】——PAT (Advanced Level) Practise

题目信息 1098. Insertion or Heap Sort (25) 时间限制100 ms 内存限制65536 kB 代码长度限制16000 B According to Wikipedia: Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, insertion sort removes one el

PAT 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

PAT甲题题解1098. Insertion or Heap Sort (25)-(插入排序和堆排序)

题目就是给两个序列,第一个是排序前的,第二个是排序中的,判断它是采用插入排序还是堆排序,并且输出下一次操作后的序列. 插入排序的特点就是,前面是从小到大排列的,后面就与原序列相同. 堆排序的特点就是,后面是从小到大排列的最大的几个数p~n-1,前面第一位则是p-1. 所以只要先按照插入排序的特点来判断是否为插入排序,接下来再进行操作就可以了,这里要手动写下最大堆的更新操作. 代码: #include <iostream> #include <cstdio> #include <

PAT (Advanced Level) 1098. Insertion or Heap Sort (25)

简单题.判断一下是插排还是堆排. #include<cstdio> #include<cstring> #include<cmath> #include<vector> #include<map> #include<queue> #include<stack> #include<algorithm> using namespace std; const int maxn=200; int a[maxn],b[m

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

A1098 Insertion or Heap Sort (25分)

一.技术总结 这是一道考查插入排序和堆排序的问题. 这里开始最主要的问题是,没有理解堆排序.堆排序是通过把数组中第一个元素与最后一个元素交换,然后再对于第一个元素进行向下调整downAdjust函数. 所以这里对于插入排序,只要一直遍历发现第一个元素的比前一个元素小,记录下这时的下标.然后同时后面的元素与原数组相同,那么就是插入排序. 对于堆排序怎么知道到哪一步,根据堆排序的特点知道.是通过从后往前交换元素,然后使用downAdjust函数调整,所以要判断,就从后往前判断,如果出现当前元素,比首

PAT甲级——1098 Insertion or Heap Sort (插入排序、堆排序)

本文同步发布在CSDN:https://blog.csdn.net/weixin_44385565/article/details/90941941 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 iterati