关于C++实现地精排序

C++实现地精排序

#include <iostream>
#include <vector>
using namespace std;
void swap(int* a, int* b)
{
	int temp;
	temp = *a;
	*a = *b;
	*b = temp;
}
void Goblin_sort(vector<int> &a)
{
	for (int i = 1; i < a.size();)
	{
		if (a[i] < a[i - 1])
		{
			swap(&a[i], &a[i - 1]);
			if (i > 1) i--;
		}
		else i++;
	}
}
int main()
{
	vector<int> a = { 12,3,4,76,23,1,23,34 };
	Goblin_sort(a);
	for (int i = 0; i < a.size(); i++)
	{
		cout << a[i] << " ";
	}
}