09-排序3 Insertion or Heap Sort (25分)
来源:互联网 发布:贵州水利软件 编辑:程序博客网 时间:2024/06/06 03:28
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 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
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
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 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:
103 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>int main() {int n, i, count, length, a[100], b[100];int flag = 1;scanf("%d", &n);for (i = 0;i < n;i++)scanf("%d", &a[i]);for (i = 0;i < n;i++)scanf("%d", &b[i]);for (i = 1; b[i] >= b[i - 1]; i++);count = i;for (;i < n && a[i] == b[i];i++);if (i == n) {printf("Insertion Sort\n");std::sort(b, b + count + 1);printf("%d", b[0]);for (i = 1;i < n;i++)printf(" %d", b[i]);}else {printf("Heap Sort\n");for (i = n - 1;i > 0 && b[i] > b[i - 1];i--);std::pop_heap(b, b + i + 1);printf("%d", b[0]);for (i = 1;i < n;i++)printf(" %d", b[i]);}return 0;}
0 0
- 09-排序3 Insertion or Heap Sort (25分)
- 09-排序3 Insertion or Heap Sort (25分)
- 09-排序3 Insertion or Heap Sort (25分)
- 09-排序3 Insertion or Heap Sort (25分)
- 09-排序3 Insertion or Heap Sort
- 09-排序3 Insertion or Heap Sort
- Insertion or Heap Sort(25 分)
- 5-14 Insertion or Heap Sort (25分)
- Insertion or Heap Sort (25)
- 1098. Insertion or Heap Sort (25)[插入和堆排序]
- PAT--1098. Insertion or Heap Sort(排序)
- 1098. Insertion or Heap Sort (25)
- 1098. Insertion or Heap Sort (25)
- 1098. Insertion or Heap Sort (25)
- PAT 1098. Insertion or Heap Sort (25)
- [PAT]1098. Insertion or Heap Sort (25)
- 【PAT】1098. Insertion or Heap Sort (25)
- 1098. Insertion or Heap Sort (25)
- JSON Web Token (JWT) - 在Web应用间安全地传递信息
- Git中rebase的作用
- Android studio 中引入第三方jar的方法
- SEO如何处理采集内容(3)
- 《C++ Primer》读书笔记-第二章 06 处理类型
- 09-排序3 Insertion or Heap Sort (25分)
- 侵入式和非侵入式的区别
- 欢迎使用CSDN-markdown编辑器
- Java多态性理解
- jQuery快速学习
- [链接]历年真题软件设计师下午考试题汇分析与技巧
- 《大数据工程师(开发)面试系列(2)》
- 《C++ Primer》读书笔记-第二章 07 自定义数据结构
- C#委托的内部构成