参考http://blog.csdn.net/liuchen1206/article/details/6954074
以及http://blog.csdn.net/morewindows/article/details/6684558
边写边想,起初并没理解大佬说的快排就像填坑,写的过程才理解了,过程中遇到很多小问题,针对我的问题做了点细节补充,若有错误欢迎指正!
#include<iostream>
using namespace std;
void quickSort(int arr[], int left, int right)
{
if (left < right)
{
int key = arr[left]; //比较点,这是第一个坑,将left位置的value存入key中,坑就出来了
int i = left, j = right;
while (i < j)
{
while (arr[j] > key && j > i) //arr[j] > key可以换为arr[j] >= key,但j > i不可以换为j >= i,边界问题
j--;
if (i < j)
arr[i++] = arr[j];
while (arr[i] < key && i < j) //同理
i++;
if (i < j)
arr[j--] = arr[i];
}
arr[i] = key; //此时不用纠结是arr[i] = key还是arr[j] = key,因为i = j
quickSort(arr, left, i - 1);
quickSort(arr, i + 1, right);
}
}
int main()
{
int a[10];
for (int i = 0; i < 10; i++)
{
a[i] = rand() % 10;
printf("%d ", a[i]);
}
printf("\n");
quickSort(a, 0, 9);
for (int i = 0; i < 10; i++)
{
printf("%d ", a[i]);
}
printf("\n");
system("pause");
return 0;
}
#include<iostream>
using namespace std;
void quickSort(int arr[], int left, int right)
{
if (left < right)
{
int key = arr[left]; //比较点,这是第一个坑,将left位置的value存入key中,坑就出来了
int i = left, j = right;
while (i < j)
{
while (arr[j] > key && j > i) //arr[j] > key可以换为arr[j] >= key,但j > i不可以换为j >= i,边界问题
j--;
if (i < j)
arr[i++] = arr[j];
while (arr[i] < key && i < j) //同理
i++;
if (i < j)
arr[j--] = arr[i];
}
arr[i] = key; //此时不用纠结是arr[i] = key还是arr[j] = key,因为i = j
quickSort(arr, left, i - 1);
quickSort(arr, i + 1, right);
}
}
int main()
{
int a[10];
for (int i = 0; i < 10; i++)
{
a[i] = rand() % 10;
printf("%d ", a[i]);
}
printf("\n");
quickSort(a, 0, 9);
for (int i = 0; i < 10; i++)
{
printf("%d ", a[i]);
}
printf("\n");
system("pause");
return 0;
}