package wuxue;
public class quicksort implements shuzu {
private int sorts[];
private int n;
public quicksort() {
// TODO Auto-generated constructor stub
n=shuzu.length;
sorts=new int[n];
for(int i=0;i<n ;i++)
{
sorts[i]=shuzu[i];
}
sort(sorts,0,n-1);
prints();
}
private void sort(int sorts[],int low1,int high1)
{
int tempdata=sorts[low1],low=low1,high=high1;
while(low<high)
{
while(tempdata<=sorts[high]&&low<high)high--;
if(low<high)
sorts[low++]=sorts[high];
while(tempdata>=sorts[low]&&low<high)low++;
if(low<high)
sorts[high--]=sorts[low];
}
sorts[low]=tempdata;
if(low1<low-1)
sort(sorts,low1,low-1);
if(low+1<high1)
sort(sorts,low+1,high1);
}
private void prints()
{ System.out.print("快速排序:");
for(int i=0;i<n;i++)
System.out.print(sorts[i]+" ");
System.out.println();
}
}
快速排序
最新推荐文章于 2023-12-01 23:14:38 发布