7-14 Insertion or Heap Sort (25 分) 堆排序的熟悉与简单应用

最新推荐文章于 2024-10-18 23:42:37 发布

碧海潮声按玉箫

最新推荐文章于 2024-10-18 23:42:37 发布

阅读量297

点赞数

分类专栏：数据结构与算法习题文章标签：算法排序算法

本文链接：https://blog.csdn.net/m0_49840707/article/details/122130691

版权

根据给定的输入序列，需要判断使用的是插入排序还是堆排序。插入排序的特点是每次将一个元素插入到已排序的序列中，而堆排序则是通过构建最大堆并提取最大元素来逐步排序。题目提供了一组初始序列和部分排序后的序列，要求确定排序方法并进行下一步操作。对于示例，第一组输入表明使用了插入排序，第二组则表明使用了堆排序。代码实现需要分析序列特征以区分两种排序方式。

摘要由CSDN通过智能技术生成

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

这题和上一题其实差不多，只不过把归并排序换成了堆排序，就是首先判断是直接插入还是堆排序，直接插入的话用sort，堆排序的话找到对应的那一步然后再进行一步就可以了；但是我还是不明白直接插入排序那里为什么
是sort(S + 1, S + i + 2); 而不是i+1或者i+3；i+3显然可以排除，但是不明白为什么明明S[i+1]为无序区元素，且挨着有序区，难度不是排序sort到i+1吗？
总体代码如下：

#include<iostream>
#include<algorithm>
using namespace std;
//堆排序
void sift(int R[], int low, int high)//对堆进行筛选(从low到high），使其重新成为最大堆
{
   
	int i = low, j = 2 * i;
	int temp =