參考:http://hi.baidu.com/thinkingidea/item/91aa7a0939e45637a3332ae0
17 void quicksort(int arrary[],int low, int high)
18 {
19 int i = low, j = high, pivot = arrary[low];
20
21 if (low > high) return ;
22 while (i<j)
23 {
24 while ((i<j)&&(pivot<=arrary[j])) j--;
25 if (i<j)
26 arrary[i++] = arrary[j];
27
28 while ((i<j)&&(arrary[i]<=pivot)) i++;
29 if (i<j)
30 arrary[j--] = arrary[i];
31 }
32
33 arrary[j] = pivot;
34 quicksort(arrary,low,i-1);
35 quicksort(arrary,i+1,high);
36 }