关于 C 快排的问题，总有问题，求教

This topic created in 3995 days ago, the information mentioned may be changed or developed.

void iswap(int *v,int *t)
{
*v=*v^*t;
*t=*v^*t;
*v=*v^*t;
}

void iqsort(int *v,int begin,int end)
{
int left=begin;
int right=end;
int flag=v[(begin+end)/2];

if(begin>=end)
    return;

iswap(&v[left],&v[(begin+end)/2]);

while(left<right){
    while(left<right&&v[right]>flag)
        right--;
    v[left++]=v[right];
    while(left<right&&v[left]<=flag)
        left++;
    v[right--]=v[left];
}
v[left]=flag;

iqsort(v,begin,left-1);
iqsort(v,left+1,end);

}

当对{2,5,4,9,8,4,65}排序时，会有问题。什么原因呢？

int

iqsort

left

10 replies • 2015-06-22 14:06:18 +08:00

theFool

Jun 18, 2015

void iswap(int *v,int *t) {
int temp = *v;
*v = *t;
*t = temp;
}

void iqsort(int *v,int begin,int end) {
int left=begin;
int right=end;
int flag=v[(begin+end)/2];

if(begin>=end)
return;

iswap(&v[left],&v[(begin+end)/2]);

while(left<right) {
while(left<right&&v[right]>flag)
right--;
v[left]=v[right];
while(left<right&&v[left]<=flag)
left++;
v[right]=v[left];
}
v[left]=flag;

iqsort(v,begin,left-1);
iqsort(v,left+1,end);
}