Insertion or Heap Sort(25 分)
来源:互联网 发布:李弘基变脸软件 编辑:程序博客网 时间:2024/05/19 06:47
7-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 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:
103 1 2 8 7 5 9 4 6 01 2 3 7 8 5 9 4 6 0
Sample Output 1:
Insertion Sort1 2 3 5 7 8 9 4 6 0
Sample Input 2:
103 1 2 8 7 5 9 4 6 06 4 5 1 0 3 2 7 8 9
Sample Output 2:
Heap Sort5 4 3 1 0 2 6 7 8 9
#include<iostream>using namespace std;int main(){int N; cin>>N;int i,j,flag=1,tag=0;int num0[N],num1[N];for(i=0;i<N;i++)cin>>num0[i];for(i=0;i<N;i++)cin>>num1[i];for(i=0;i<N-1;i++)if(num1[i]>num1[i+1]) break;for(j=i+1;j<N;j++)if(num1[j]!=num0[j]) flag=0;if(flag==0){cout<<"Heap Sort"<<endl;for(j=1;j<N;j++)if(num1[(j-1)/2]<num1[j]) break;j=j-1;int temp=num1[j];num1[j]=num1[0];num1[0]=temp;j--;int parent,child;temp=num1[0];for(parent=0;2*parent+1<=j;parent=child){child=parent*2+1;if(child<j&&num1[child+1]>num1[child])child++;if(num1[child]>temp) num1[parent]=num1[child];else break;} num1[parent]=temp;}else{cout<<"Insertion Sort"<<endl;int temp=num1[i+1];for(i=i+1;i>0;i--)if(num1[i-1]>temp) num1[i]=num1[i-1];else break;num1[i]=temp;}for(int k=0;k<N;k++)if(tag++==0) cout<<num1[k];else cout<<" "<<num1[k];return 0;}
- Insertion or Heap Sort(25 分)
- 09-排序3 Insertion or Heap Sort (25分)
- 09-排序3 Insertion or Heap Sort (25分)
- 5-14 Insertion or Heap Sort (25分)
- 09-排序3 Insertion or Heap Sort (25分)
- Insertion or Heap Sort (25)
- 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)
- 1098. Insertion or Heap Sort (25)
- 1098. Insertion or Heap Sort (25)
- 1098. Insertion or Heap Sort (25)
- 1098. Insertion or Heap Sort (25)
- 1098. Insertion or Heap Sort (25)
- 5.4年利率
- 用原生js写省市级联
- KS-1002UA和KS-1004UA切换器
- loj6013「网络流 24 题」负载平衡(费用流)
- ubuntu16.04安装KVM
- Insertion or Heap Sort(25 分)
- Spring事务的传播行为和隔离级别
- IDLE编辑窗口与label之间的灰色地带怎么弄没啊?前两天好着不知道点哪了弄成这个样子了,原谅我是个强迫症!!!!
- PHP递归多维数组替换键名和键值
- Windows设置本地DNS域名解析Hosts
- Web开发学习笔记--JAvaScript JQuery AJax
- Kubernetes与OpenStack融合支撑企业级微服务
- 线程的相关概念
- Android Banner(无限轮播图)控件的简单使用(网络数据OkHttp3)