http://acm.csu.edu.cn/OnlineJudge/problem.php?id=1352 题意:就是要将7 1 5 2这样的序列变成1  2  5  7最少需要多少步?给出变的规律,每次把最前面的那个数移动到比它次小的数的后面,要是它后面没有比它次小的数,就移动到最后,问最少需要多少步? For example, we will use 7 steps to sort the sequence 7 1 5 2:    7 1 5 2 --> 1 5 7 2 --> 5 7 2…

因为每个元素都是移动到比它小1位的元素的后面: 这样的话以后的一定就可以把他们两个打包: 所以用这种方法最多扫一遍就可以了: 但是最小的那个数要不要移动呢? 如果最小的数后面的数都是升序的,那么一直扫到最小的那个数就行了: 不然的话要完整的扫一遍: 这个地方我没想清楚,WA的好惨,最后还是看到斌哥的代码才恍然大悟的: #include<cstdio> #include<algorithm> #define maxn 100005 using namespace std; int n…

1352: New Sorting Algorithm Time Limit: 1 Sec  Memory Limit: 128 MB Description We are trying to use a new sorting algorithm to sort a sequence with distinct integers.    This algorithm will be end if the sequence is already in increasing order from…

1306. Sorting Algorithm Constraints Time Limit: 1 secs, Memory Limit: 32 MB 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. So…

Bubble sort,It's a relatively basic algorithm.The core implementation ideas are as follows: 1.Define an array,The length is N. 2.Compares each pair of adjacent items and swaps them if they are in the wrong order. such as: if (a[j - 1] > a[j]) {//The…

http://www.algolist.net/Algorithms/ https://docs.oracle.com/javase/tutorial/collections/algorithms/ https://en.wikipedia.org/wiki/Sorting_algorithm 冒泡排序(Bubble sort) https://en.wikipedia.org/wiki/Bubble_sort loop1: 4,6,1,3,7 -> 4,6,1,3,7 4,6,1,3,7 ->…

题目地址:http://ac.jobdu.com/problem.php?pid=1352 题目描述: 输入一个递增排序的数组和一个数字S,在数组中查找两个数,是的他们的和正好是S,如果有多对数字的和等于S,输出两个数的乘积最小的. 输入: 每个测试案例包括两行: 第一行包含一个整数n和k,n表示数组中的元素个数,k表示两数之和.其中1 <= n <= 10^6,k为int 第二行包含n个整数,每个数组均为int类型. 输出: 对应每个测试案例,输出两个数,小的先输出.如果找不到,则输出“-1…

sorting 应该是最容易被考到的东西,自己老是学了背,背了忘.为了方便复习,这里进行总结 1. Bubble Sort 定义:每两个两个比较,每扫完一次,当前扫过的最大值放在了末尾. for i = (n-1) to 1 for j = 0 to i-1 if(A[j] > A[j+1]) swap Time Complexity: Best case : O(n) It can occur if the array is already sorted and no swap occurre…

https://en.wikipedia.org/wiki/Selection_sort loop1: 4,6,1,3,7 -> 4,6,1,3,7 4,6,1,3,7 -> ,3,7 1,6,4,3,7 -> 1,6,4,3,7 1,6,4,3,7 -> 1,6,4,3,7 loop2: 1,6,4,3,7 -> 1,4,6,3,7 1,4,6,3,7 -> 1,,7 1,3,6,4,7 -> 1,3,6,4,7 loop3: 1,3,6,4,7 -> 1…

https://en.wikipedia.org/wiki/Insertion_sort loop1: 4,6,1,3,7 -> 4,6,1,3,7 loop2: 4,6,1,3,7 -> 4,1,6,3,7 4,1,6,3,7 -> 1,4,6,3,7 loop3: 1,4,6,3,7 -> 1,4,3,6,7 1,4,3,6,7 -> 1,3,4,6,7 1,3,4,6,7 -> 1,3,4,6,7 loop4: 1,3,4,6,7 -> 1,3,4,6,7…