C++二分排序
升序的方式排列,具体的实现方法:
void swap(int &a, int &b)
{
int temp = a;
a = b;
b = temp;
}
void sort(int a[], int n)
{
int low = 0;
int high = n - 1;
while (low < high)
{
while (low < high && a[low] <= a[high])
high--;
swap(a[low], a[high]);
while (low < high && a[low] <= a[high])
low++;
swap(a[low], a[high]);
}
}
4.18打卡结束