6.7—排序—Sort Colors

描述
Given an array with n objects colored red, white or blue, sort them so that objects of the same color
are adjacent, with the colors in the order red, white and blue.
Here, we will use the integers 0, 1, and 2 to represent the color red, white, and blue respectively.
Note: You are not suppose to use the library’s sort function for this problem.
Follow up:
A rather straight forward solution is a two-pass algorithm using counting sort.
First, iterate the array counting number of 0’s, 1’s, and 2’s, then overwrite array with total number of
0’s, then 1’s and followed by 2’s.
Could you come up with an one-pass algorithm using only constant space?

#include<iostream>
using namespace std;
//遍历一遍数组，将0，1，2，0，2，1，0，0，1，2，1，0等这类数字排序
inline void swap(int &a, int &b)
{
	int c = a;
	a = b;
	b = c;
}
void SortColors(int a[], int n)
{
	int index = 0;
	int pbegin = 0;
	int pend = n - 1;
	for (index = 0; index < pend;)
	{
		if (a[index] == 0)
		{
			swap(a[index], a[pbegin]);
			index++;
			pbegin++;
		}
		else if (a[index] == 2)
		{
			swap(a[index], a[pend]);
			pend--;
		}
		else
		{
			index++;
		}
	}
}
int main()
{
	const int n = 10;
	int a[n] = { 1, 2, 0, 0, 2, 2, 1, 1, 1, 0 };
	SortColors(a, n);
	for (int i = 0; i < n; i++)
		cout << a[i] << " ";
	cout << endl;
}