1098 Insertion or Heap Sort (25 分) 堆排序

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 (≤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

n<100 插入排序可以直接用sort模拟

堆排序得老老实实写，记住模板就没有难度

卡点：if(j+1<=high&&heap[j+1]>heap[j]) j++; 向下调整，j+1<=high千万别忘了

#include<bits/stdc++.h>
using namespace std;

int heap[110],n,a[110],ans[110]; 

bool judge(int a[]){
	for(int i=1;i<=n;i++){
		if(a[i]!=ans[i]) return false;
	}
	return true;
}

void print(int a[]){
	for(int i=1;i<=n;i++){
		if(i!=1) cout<<" ";
		cout<<a[i];
	}
	cout<<endl;
}

//跑不掉的建立堆
//向下调整low  high是上界 
void down(int low,int high){
	int i=low,j=i*2;//i父亲  j儿子
	while(j<=high){
		//j+1<high★★★ 
		if(j+1<=high&&heap[j+1]>heap[j]) j++;//★ 千万注意j+1<high别忘了★★  否则堆排序时是假设最后一个结点删除 肯定会出错  
		if(heap[i]<heap[j]){
			swap(heap[i],heap[j]);
			i=j;
			j=i*2;
		}else{
			break;
		}
	}
}


void create(){
	for(int i=n/2;i>=1;i--){
		down(i,n);
	}
}

//每次将堆顶放到最后 然后对剩下1~n-1个进行调整堆顶 
void heapSort(){
	create();//先建堆(就是调序)别忘了 
	bool canprint=false;
	for(int i=n;i>=1;i--){// 注意for循环内有i-- 循环体不能再i--了 
		swap(heap[1],heap[i]);
		down(1,i-1);//i-1 不是n-1小心 
		if(canprint){
			print(heap);
			return;
		}
		if(judge(heap)){
			canprint=true;
		}
	}
}

int main(){
	//freopen("in.txt","r",stdin);
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];//为了方便比较 下标都从1开始 
		heap[i]=a[i];
	}
	for(int i=1;i<=n;i++) cin>>ans[i];
	
	bool find=false;
	//至少排两个  a[1]~a[i] 
	for(int i=2;i<=n;i++){
		sort(a+1,a+i+1);
		if(judge(a)){
			cout<<"Insertion Sort\n";
			sort(a+1,a+i+2);
			print(a);
			find=true;
			break;
		}
	}
	if(!find){
		cout<<"Heap Sort\n"; 
		heapSort();
	} 
	return 0;
}

来源：CSDN

作者：树叶子_

链接：https://blog.csdn.net/hza419763578/article/details/100567526

标签

sort