/**
* 学习快速排序
*
* @author Administrator
*
*/
public class HolleWord {
public static void main(String[] args) {
int[] px = { 13, 23, 45, 3, 44, 24, 64, 32, 55 };//需要排序的数组
for (int i = 0; i < px.length; i++) {
System.out.print(px[i] + " "); //未排序前数组
}
System.out.println();
HolleWord holleWord = new HolleWord();
int count=holleWord.kspx(px, 0, px.length - 1);
for (int i = 0; i < px.length; i++) {
System.out.print(px[i] + " "); //排序后数组
}
System.out.println();
System.out.println(count); //循环次数
}
public int kspx(int[] px, int min, int max) {
int count=0; //记录循环次数
int phdwz = min; //记录平衡点位置
int phdzqwz = phdwz;//记录平衡点之前的位置
int m;//用于中间传值
boolean b;
boolean p;
int i = max;
do {
b = false;
p = false;
for (; i > phdwz; i--) {
count++;
if (px[phdwz] > px[i]) {
m = px[phdwz];
px[phdwz] = px[i];
px[i] = m;
phdzqwz = phdwz;
phdwz = i;
b = true;
break;
}
}
for (int j = phdzqwz; j < phdwz; j++) {
count++;
if (px[phdwz] < px[j]) {
m = px[phdwz];
px[phdwz] = px[j];
px[j] = m;
phdzqwz = phdwz;
phdwz = j;
p = true;
break;
}
}
} while (p || b);
if (phdwz > min + 1) {
count+=kspx(px, min, phdwz - 1); //左边元素排序
}
if (phdwz < max - 1) {
count+=kspx(px, phdwz + 1, max); //右边元素排序
}
return count;
}
}