c++排序算法
一、快速排序
//与选取的基准值进行比较
int getPartion(int *array, int low, int high)
{
cout << "low=" << low << "high=" << high << endl;
int key = array[low]; //基准值
while (low < high)
{
//与最右侧比较
while (low < high && key <= array[high]) //如果array[high]大于基准值,那么本就应该在基准值右边
high--; //因此将high下标向前移动,直至找到比键值小的值,此时交换这两个值
swap(array[low], array[high]);
//与最左边比较
while (low < high && key >= array[low])
low++;
swap(array[low], array[high]);
}
return low;//返回key值的下标
}
//low为数组最左边位置,high为数组最右边位置
void QuitSort(int *buf, int low, int high)
{
if (low < high)
{
int key = getPartion(buf, low, high);
QuitSort(buf, low, key - 1);
QuitSort(buf, key + 1, high);
}
}
二、插入排序
//最简单的插入排序
//向前比较,当前者大于后者时&#