sicily Sorting Algorithm 一道题玩一种排序之shell排序
来源:互联网 发布:sql跟踪工具 编辑:程序博客网 时间:2024/05/12 03:46
题目
Description
One of the fundamental problems of computer science is ordering a list of items. There’re a plethora of solutions to this problem, known as sorting algorithms. Some sorting algorithms are simple and intuitive, such as the bubble sort. Others, such as the heap sort are not so simple, but produce lightening-fast results.
In the following is a list of some sorting algorithms. Of course, I can’t tell you how to implement them here. You must use your own knowledge.
Bubble sort
Heap sort
Insertion sort
Merge sort
Quick sort
Selection sort
Shell sort
…
My business here is to give you some numbers, and to sort them is your business. Attention, I want the smallest number at the top of the sorted list.
Input
The input file will consist of series data sets. Each data set has two parts. The first part contains two non-negative integers, n (1≤n≤100,000) and m (1≤m≤n), representing the total of numbers you will get and interval of the output sorted list. The second part contains n positive integers. I am sure that each integer in this part will be less than 2,000,000,000.
The input is terminated by a line with two zeros.
Output
For one data set, you should output several numbers in ONE line. After you get the sorted list, you should output the first number of each m numbers, and you should print exact ONE space between two adjacent numbers. And please make sure that there should NOT be any blank line between outputs of two adjacent data sets.
Sample Input
8 2
3
5
7
1
8
6
4
2
0 0
Sample Output
1 3 5 7
思考
1、输入数据较多,还是用回c的输入比较稳妥,另外排序的话虽然还是选的时间复杂度为O(n^2)
的算法,但shell算法作为优化的插入算法还是有较优的平均查找复杂度的(O(n^1.3)
)
2、比较坑的是题目给的样例误导人啊,我一开始还以为是对于排序数字的间隔,原来就是简单的位置间隔。
代码
#include <iostream>#include <stdio.h>void shellsort(int* arr, int n) { int j, k, gap, temp; for (gap = n / 2; gap > 0; gap /= 2) { for (j = gap; j < n; j++) { if (arr[j] < arr[j - gap]) { temp = arr[j]; k = j - gap; while (k >= 0 && arr[k] > temp) { arr[k + gap] = arr[k]; k -= gap; } arr[k + gap] = temp; } } }}using namespace std;int main(int argc, const char * argv[]) { int n, m; int a[100000]; while (1) { scanf("%d%d", &n, &m); if (n == 0) break; for (int i = 0; i < n; i++) { scanf("%d", &a[i]); } shellsort(a, n); printf("%d", a[0]); for (int i = m; i < n; i+=m) { printf(" %d", a[i]); } printf("\n"); } return 0;}
- sicily Sorting Algorithm 一道题玩一种排序之shell排序
- sorting algorithm排序算法
- 排序算法-Sorting algorithm
- sicily--1306. Sorting Algorithm
- Sicily 1306. Sorting Algorithm
- sicily 1306. Sorting Algorithm
- sicily Sorting Algorithm
- Sicily 1142. Pancake Sorting(煎饼排序)
- LeetCode 之排序 sorting
- 排序算法(Shell Sorting希尔排序)
- Sorting Algorithm-Shell Sort
- Collection of algorithm for sorting. 常见排序算法集(一)
- Collection of algorithm for sorting. 常见排序算法集(二)
- Chapter7. Sorting algorithm summary C++/Python 排序算法总结
- 排序(sorting)
- 排序 Sorting
- Sort Algorithm 之 交换排序
- 【Data Structure/Algorithm】排序之冒泡排序
- HTTP图解
- Jetson TX1 开发教程(1)——配置与刷机
- hadoop异常 java.io.IOException: Job status not available
- 登录流程
- 游戏与算法的必经之路
- sicily Sorting Algorithm 一道题玩一种排序之shell排序
- 多线程性能及效率问题
- android屏幕刷新显示机制
- 欢迎使用CSDN-markdown编辑器
- Spring Boot 动态数据源(多数据源自动切换)
- bzoj 4034: [HAOI2015]树上操作 (树链剖分)
- 如何理解微服务时代的DevOps
- 关于C语言操作数据库获取结果集
- laravel数据批量操作