Java enables quick sorting

<pre name= "code" class= "Java" >package Com.test.linked;public class QuickSort {public class array{private int[] myarray;private int size;public Array (int max) {myarray=new int[max];size=0;} /** * Insert Data * @param value */public void insert (int value) {myarray[size]=value;size++;} /** * Sort */public void sort () {requicksort (0,size-1);} /** * Sorting, using recursion to divide the array into smaller two arrays * @param left * @param right */public void requicksort (int left,int right) {if (right-left<=0) { return;} Else{int center=myarray[right];int Partition=partitionarray (left,right,center); Requicksort (left,partition-1); Requicksort (Partition+1,right);}} /** * Define HUB position * @param left * @param right * @param center * @return */public int partitionarray (int left,int Right , int center) {int Leftpart=left-1;int rightpart=right;while (leftpart<rightpart) {while (myarray[++leftpart]< Center&&leftpart<right);//Find a larger number while (rightpart>=left&&myarray[--rightpart]>) than the center Center)//Find a smaller number if (Leftpart>=rightpart) {break;} Else{swap (Leftpart,rightpart)///Two number Exchange}}swap (leftpart,right);//re-record the location of the hub return leftpart;// Because left and right exchange so return leftpart}/** * Exchange data * @param leftpart * @param rightpart */public void swap (int leftpart,int rightpart) { int Temp=myarray[leftpart]; Myarray[leftpart]=myarray[rightpart]; Myarray[rightpart]=temp;} /** * Display array */public void display () {System.out.println ("array Begin"), for (int i = 0; i < size; i++) {System.out.println (Myarray[i]);}} public static void Main (string[] args) {int max=10; QuickSort sort=new QuickSort (); Array test=sort.new Array (int i = 0; I <max; i++) {Test.insert ((int) (Math.random () *87));} Test.display (); Test.sort (); Test.display ();}}

Data:

<pre name= "code" class= "java" >array Begin218104846867630172array begin021721304648768186

Java enables quick sorting