//使用递归实现快速排序
void qsort(int v[], int left, int right)//left,right代表左右扫描
{
int i, last;
void swap(int v[], int i, int j);
if (left >= right) /* 数组是空的时候 */
return; /* fewer than two elements */
swap(v, left, (left + right) / 2); /* move partition elem */
last = left; /* to v[0] */
for (i = left + 1; i <= right; i++) /* partition */
if (v[i] < v[left])
swap(v, ++last, i);
swap(v, left, last); /* restore partition elem */
qsort(v, left, last - 1);
qsort(v, last + 1, right);
}
/* swap: interchange v[i] and v[j] */
void swap(int v[], int i, int j)
{
int temp;
temp = v[i];
v[i] = v[j];
v[j] = temp;
}
the c programming language 上快排代码
最新推荐文章于 2024-08-08 09:34:26 发布