Matin_Delphi
شنبه 08 تیر 1387, 12:14 عصر
سلام این کد با جاوا هستش که زیادم فرق نمی کنه
public void quick(int [] a,int low,int high){
if(low<high){
int pl = partition(a,low,high);
quick(a,low,pl-1);
quick(a,pl+1,high);
}
}
private int partition(int a[],int low,int high){
int n=(low + high)/2;
swap(a,low,n);
int pivot = a[low];
int lastsmall = low;
for (int i = low+1; i<=high; i++) {
if(a[i]<pivot){
lastsmall++;
swap(a,lastsmall,i);
}
}
swap(a,low,lastsmall);
return lastsmall;
}
public void swap(int a[],int x,int y){
int temp = a[x];
a[x]=a[y];
a[y]=temp;
}
//QuickSort Completed Successfuly...