1、快速排序的过程
2、真假排序
#include<iostream>
using namespace std;
int main()
{
int a[10] = {0,1,0,1,0,1,0,1,0,1};//全为0,1的数组
for (int i = 0; i < 10; i++)
{
cout << a[i] << ' ';
}
cout << endl;
int j = 9;
for (int i = 0; i < 10; i++)
{
if (j == i)//防止比较越界
break;
if (a[i] == 0)
continue;
else
{
while (a[i] == 1)//将1放到数组后面
{
int swap;
swap = a[i];
a[i] = a[j];