交换排序
//冒泡排序
void swap(int &a, int&b) {
int temp = a;
a = b;
b = temp;
}
void BubbleSort(int A[], int n) {
int flag,i,j;
for (i = 0;i < n - 1;i++)
flag = false;//表示本次冒泡是否发生交换的标志
for (j = n - 1;j > i;j--) {
if (A[j - 1] > A[i]) {
swap(A[j - 1], A[j]);
flag = true;
}
if (flag == false)//没有发生交换,说明有序
return;
}
}
//快速排序
int partition(int A[], int low, int high) {/
int pivot = A[low];
while (low < high) {
while (low < high&&A[high] >= pivot)
--high;
A[low] = A[high];
while (low < high&&A[low] <= pivot)
++low;
A[high] = A[low];
}
A[low] = pivot;
return low;
}
void quickSort(int A[], int low, int high) {
if (low < high) {
int pivotpos = partition(A, low, high);
quickSort(A, low, pivotpos - 1);
quickSort(A, pivotpos + 1, high);
}
}
数据结构之排序(二)
最新推荐文章于 2024-09-16 20:32:31 发布