5-1 Insertion or Heap Sort
来源:互联网 发布:淘宝开店交保证金多少 编辑:程序博客网 时间:2024/04/29 16:35
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
//
// main.c
// 数据结构第十二周——堆排or插排
//
// Created by apple on 2016/12/24.
// Copyright © 2016年 apple. All rights reserved.
//
//思路:每排序一次,就比较一下当前排序的数组与题目给的中间数组,看是哪种排序方法。
//只要舍得内存和运行速度,测试点都是能过的2333
//不要直接copy宝宝作业哟
- 5-1 Insertion or Heap Sort
- 5-1 Insertion or Heap Sort (9分)
- 1098.Insertion or Heap Sort
- 1098. Insertion or Heap Sort
- PAT1098 Insertion or Heap Sort
- 1098 Insertion or Heap Sort
- 1098. Insertion or Heap Sort
- pat1098. Insertion or Heap Sort
- Insertion or Heap Sort (25)
- 1098. Insertion or Heap Sort
- 1098. Insertion or Heap Sort
- 1098. Insertion or Heap Sort
- PAT-Insertion or Heap Sort
- 5-14 Insertion or Heap Sort (25分)
- 5-1 Insertion or Heap Sort (9分)
- PAT 1098. Insertion or Heap Sort
- 1098. Insertion or Heap Sort (25)
- 1098. Insertion or Heap Sort (25)
- javascript 获取和设置属性getAttribute setAttribute
- JavaWeb(五)---imgCode
- 树莓派系统、硬件更新
- Array的一些排序算法
- python中datetime中now和utcnow的区别
- 5-1 Insertion or Heap Sort
- 【深入Java虚拟机】之一:Java内存区域与内存溢出
- C语言求杨辉三角的6种方法
- java 单例模式之线程安全的饿汉模式和懒汉模式
- swap设置
- Bootstrap-modal拖动
- 从C++到java(三)
- OpenStack官方操作指南(4)计算节点
- BZOJ3029: 守卫者的挑战