快速排序的思想:
int temp=numbers[low];//把首数字存到temp中
while(low<top){
while(low<top&numbers[top]>temp){
top--;
}
numbers[low]=numbers[top];
while(low<top&numbers[top]<temp){
low++;
}
numbers[top]=numbers[low];
}
numbers[low]=temp;
return low;
if(low<top)
{
int middle=getMid(numbers,low,top);
quickSort(numbers,low,middle-1);
quickSort(numbers,middle+1,top);
}
if(numbers.length>0){
quickSort(numbers,0,numbers.length-1);
}
}
public static void printArr(int[] numbers){
for(int i = 0 ; i < numbers.length ; i ++ )
{
System.out.print(numbers[i] + ",");
}
System.out.println("");
}
public static void main(String[] args) {
int[] numbers = {10,20,15,0,6,7,2,1,-5,55};
System.out.print("排序前:");
printArr(numbers);
quick(numbers);
System.out.print("快速排序后:");
printArr(numbers);
}
}
通过一趟排序将待排序记录分割成独立的两部分,其中一部分记录的关键字均比另一部分关键字小,则分别对这两部分继续进行排序,直到整个序列有序。
public class quickSort {
//首先进行一趟排序,把数组中第一个数设为中间值,把所有数按照中间值分成两部分。返回中间值的坐标
public static int getMid(int[] numbers,int low,int top){int temp=numbers[low];//把首数字存到temp中
while(low<top){
while(low<top&numbers[top]>temp){
top--;
}
numbers[low]=numbers[top];
while(low<top&numbers[top]<temp){
low++;
}
numbers[top]=numbers[low];
}
numbers[low]=temp;
return low;
};
//利用递归不断的进行排序
public static void quickSort(int[] numbers,int low,int top){if(low<top)
{
int middle=getMid(numbers,low,top);
quickSort(numbers,low,middle-1);
quickSort(numbers,middle+1,top);
}
}
if(numbers.length>0){
quickSort(numbers,0,numbers.length-1);
}
}
public static void printArr(int[] numbers){
for(int i = 0 ; i < numbers.length ; i ++ )
{
System.out.print(numbers[i] + ",");
}
System.out.println("");
}
public static void main(String[] args) {
int[] numbers = {10,20,15,0,6,7,2,1,-5,55};
System.out.print("排序前:");
printArr(numbers);
quick(numbers);
System.out.print("快速排序后:");
printArr(numbers);
}
}