快速排序算法 java实现

 1 public class QuickRank {
 2 public static void main(String[] args) {
 3     int[] original={26,58,1,24,75,69,32,45,841,25898};
 4     QuickRank quickRank=new QuickRank();
 5     quickRank.rankSimple(original,0,original.length-1);
 6     for(int i:original)
 7         System.out.println(i);
 8 }
 9 //清晰明了
10 public void rankSimple(int[] original,int start,int end){
11         if(end<=start) return;//递归结束条件
12         int standard=original[start];
13         int leftOrder=start;
14         int rightOrder=end;
15         while(leftOrder<rightOrder){
16             //从右往左跑
17             while(leftOrder<rightOrder && original[rightOrder]>standard)
18                 rightOrder--;
19             original[leftOrder]=original[rightOrder];
20             //从左往右跑
21             while(leftOrder<rightOrder && original[leftOrder]<standard)
22                 leftOrder++;
23             original[rightOrder]=original[leftOrder];
24         }
25         original[leftOrder]=standard;
26         //递归开始
27         rankSimple(original, start, leftOrder-1);
28         rankSimple(original, leftOrder+1, end);
29     }
30 }

结果：
1
24
26
32
45
58
69
75
841
25898