一种求全排列方法的代码

void swap(int *nums, int i, int j)
{
	int tmp = nums[i];
	nums[i] = nums[j];
	nums[j] = tmp;
}

void FullArray(int *nums, int size, int idx)
{
	if(idx == size-1)
	{
		int i;
		for(i = 0; i < size; ++i)
		{
			printf("%d ", nums[i]);
		}

		printf("\n");

		return;
	}


	int i;
	for(i = idx; i < size; ++i)
	{
		swap(nums, i, idx);
		FullArray(nums, size, idx+1);
		swap(nums, i, idx);
	}
}