快速排序

return;

录入数据储存在数组a[i]

i++;

left=0;right=i-1;

yes

j--;

else

i != j?

t = a[i];\t\t\t\ta[i] = a[j];\t\t\t\ta[j] = t;

i < j?

no

a[j] >= temp && i < j?

a[i] <= temp && i < j?

打印结果

temp = a[left]; i = left; j = right;

left > right?

开始

结束