quicksort

Question: only the sorting of adjacent elements can be exchanged, and the minimum number of exchanges is counted. Analysis: grouping, reverse order number. In the process of merging and sorting, the reverse order is solved. When merging strings a and B, two pointers are used as the Count; When elements in B are added to a new array, the remaining elements in a must be greater than B; You can add each count. Note: The replacement group can be used to calculate any minimum exchange... ) # Include

Link: poj 2299 ultra-quicksort After finding the number of Adjacent Elements in a series, it is a series of ascending values. Idea: Calculate the reverse number of the string sequence. The data is relatively large and needs to be discretization. AC code: # Include

The topic is to let you ask for reverse number, with a tree-like array is very simple, but the data is too large, to be discretized first, the data range compressed to 1~n within. and POJ doesn't support c++11, it's killing me. Lambda expression compilation error.#include Copyright NOTICE: This article is the original blogger articles, reproduced please indicate the source. poj2299 (Ultra-quicksort) tree-like array + discretization

Question link: http://poj.org/problem? Id = 2299 Ideas: The number of reverse orders is the number of exchanges, so you can find the reverse Number of the sequence. According to the divide and conquer method, the sequence is divided into two parts of the same size, respectively, to find the number of reverse orders of the sub-sequence; for each number in the right sub-sequence, find the number larger than its number in the left sequence, the sum of computation is the solution. In addition, when

The main topic: Give a series, each exchange of adjacent numbers, to order the minimum number of times to increase the sequence.Analysis: Seeking reverse order number, merging sort#include #include #include #define MAXN 5000010using namespace Std;int a[maxn],tem[maxn],n;Long long Sort (int l,int R){if (l{Long Long L=sort (L, (l+r)/2);Long Long R=sort ((l+r)/2+1,r);int p=l,mid1= (L+R)/2,mid2= (l+r)/2+1;int k=l;while (p{if (mid2{Tem[k++]=a[mid2++];l+=mid1-p+1;}ElseTem[k++]=a[p++];}for (int i=l;iA[

-=lowbit (i); + } A returnRes; at } - - voidAddintIintx) { - while(I N) { -Bit[i] + =x; -i + =lowbit (i); in } - } to + - the * voidsolve () { $ while(Cin >> nN) {Panax Notoginsengmemset (bit,0,sizeof(bit)); -ll ans =0; the for(inti =0; I ) { +CIN >>Num[i].val; ANum[i].pos =i; the } +Sort (num, num +n); - for(inti =0; I ) { $ intTMP = SUM (Num[i].pos +1); $cout Endl; -Ans + = i-tmp; -Add (Num[i].pos +1,1); the } -cout Endl;

http://poj.org/problem?id=2299Merge sort: For example now there is a sequence [l,r], we can divide this sequence into two sequences [L,mid], [mid,r], using recursion to follow theThe method gradually reduces the sequence, the order of the sub-sequence, and then the sequence of sub-sequences, and then the orderly interval of the merger, very good drop embodies the idea of division.Number of reverse order (if there is i#include #include#include#include#include#include#includeusing namespacestd;#de

("The result after sorting is:");//for (int i = 0; i //System.out.print (arr[i]+ "");// } }}//Quick Sort Methodclassquick{ Public voidSortintLeftintRightint[] Array) { intL =Left ; intR=Right ; intPivot = array[(left+right)/2]; inttemp = 0; while(L r) { while(Array[l] ; while(Array[r] > Pivot) r--; if(L >=R) Break; Temp=Array[l]; ARRAY[L]=Array[r]; ARRAY[R]=temp; } //System.out.println ("The current array is");//for (int i = 0; i// {//System.out.println

Defpartition (a,i,j): k=-1while True:whilek* (A[i]-a[j]) >=0:ifi== j: returnij+=k a[i],a[j]=a[j],a[i] i,j,k=j,i-k,-kdefqsort (a,i , j): ifi Liu Shuo teacher python fine course: " Python advanced Programming Skills Combat": http://coding.imooc.com/class/62.html " python algorithm Combat video Course": http://study.163.com/course/coursemain.htm?courseid=1003617013 " Python scientific Computing-numpy Combat Course": http://edu.51cto.com/course/course_id-5046.html

PHPfunctionInsert_sort ($arr){ $count=Count($arr); for($i= 1;$i$count;$i++){ $tmp=$arr[$i]; $j=$i-1; while($arr[$j]>$tmp){ $arr[$j+1] =$arr[$j]; $arr[$j] =$tmp; $j--; if($j){ Break;//here with continue still error, do not know what yuan because? The error is that the array index appears negative } } } return $arr;}$arr=Array(49,38,65,97,76,13,27);Print_r(Insert_sort ($arr));InsertsortPHP quickSor