选修课程复习(ICPC)
选修课重难点
(个人观点)
1.快排(递归思想)
void quickSort(int *array, int left, int right)
{
if(left < right)
{
int pivot = array[left];
int low = left, high = right;
while(low < high)
{
while(array[high] >= pivot && low < high)
high--;
原创
2020-06-17 22:31:22 ·
276 阅读 ·
0 评论