各种排序算法的代码

快速排序

void quitSort(int*a, int l, int h) {

if (l >= h) {
return;
}
int low = l;
int high = h;
int key = a[l];
while (low < high) {
while (high > low&&a[high]>key) {
--high;
}
if (low == high) {


break;
}
a[low] = a[high];
while (low < high&&a[low] <= key) {
++low;
}
if (low == high) {
break;
}
a[high] = a[low];
}
a[low] = key;
quitSort(a, l, low - 1);
quitSort(a, low+1, h);

}

选择排序

void selectSort(int*a, int l, int h) {
if (l >= h) {
return;
}
for (int i = l; i < h; ++i) {