Classic algorithm 002--fast sorting

Basic concepts of fast sorting:

A quick sort is an improvement to the bubbling sort. Its basic idea is: by a trip to sort the data to be sorted into two separate parts, one part of all the data is smaller than the other part of all the data, and then the two parts of the data are quickly sorted by this method, the entire sorting process can be recursive, so as to achieve the entire data into an ordered sequence.

A group of values, using a quick sort (Quicksort), from small to large sort.

 classProgram {Static voidMain (string[] args) {            int[] arrayints =New int[] { About,6,7,2, -,8,2}; Quick_by (refArrayints,0, arrayints.length); }         Public Static voidQuick_by (ref int[] Array,intLeftintRight ) {            if(Left <Right ) {                inti =Left ; intj = Right-1; intMiddle = array[(left + right)/2];  while(true)                {                     while(I < right && Array[i] <middle) {i++; }                     while(J >0&& Array[j] >middle) {J--; }                    if(i = = j) Break; Array[i]= Array[i] +Array[j]; ARRAY[J]= Array[i]-Array[j]; Array[i]= Array[i]-Array[j]; if(Array[i] = = Array[j]) j--; } quick_by (refarray,left,i); Quick_by (refarray,i+1, right); }        }
}

Classic algorithm 002--Quick sort