冒泡排序

#include "stdafx.h"

void Swap(int *x,int *y)
{
	int tmp;
	tmp = *x;
	*x = *y;
	*y = tmp;
}

void BubbleSort1(int A[], int N)
{
	int i = 0;
	int j = 0;
	for (i=N-1; i>0; i--)
		for (j=0; j<i; j++)
			if (A[j] > A[j+1])
				Swap(&A[j],&A[j+1]);
}

void BubbleSort2(int A[], int N)
{
	int i = 0;
	int j = 0;
	bool ifSwap = false;
	for (i=N-1; i>0; i--)
	{
		ifSwap = false;
		for (j=0; j<i; j++)
		{
			if (A[j] > A[j+1])
			{
				Swap(&A[j],&A[j+1]);
				ifSwap = true;
			}
		}
		if (ifSwap == false)
			break;
	}
}

int _tmain(int argc, _TCHAR* argv[])
{
	int A[10] = {3,5,9,7,1,4,2,0,8,6};
	int B[10] = {3,5,9,7,1,4,2,0,8,6};
	BubbleSort1(A,10);
	BubbleSort2(B,10);
	return 0;
}