冒泡排序

#include <stdio.h>

void mySwap(int *a, int i, int j)
{
	int tmp = a[i];
	a[i] = a[j];
	a[j] = tmp;
}

void myPrint(int *a, int len)
{
	int i;
	for (i = 0; i < len; i++)
	{
		printf ("%4d", a[i]);
	}
	printf ("\n");
}


void mySort(int *a, int len)
{
	int left  = 0;
	int right = len-1;
	
	int i;
	while (left < right)
	{
		for (i = left; i < right; i++)  // 从左往右走，找最大元素沉底
		{
			if (a[i] > a[i+1])
			{
				mySwap(a, i, i+1);
			}
		}
		right--;
		
		for (i = right; i>left; i--)    // 从右往左走，找最小元素上浮
		{
			if (a[i] < a[i-1])
			{
				mySwap(a, i, i-1);
			}
		}
		left++;
	}
}


void mySort1(int *a, int left, int right)
{
	if (left >= right)
		return;
	
	int i;
	for (i = left; i < right; i++)  // 从左往右走，找最大元素沉底
	{
		if (a[i] > a[i+1])
		{
			mySwap(a, i, i+1);
		}
	}
	right--;
	
	for (i = right; i>left; i--)    // 从右往左走，找最小元素上浮
	{
		if (a[i] < a[i-1])
		{
			mySwap(a, i, i-1);
		}
	}
	left++;
	
	mySort1(a, left, right);
}

int main()
{
	int a[] = {9,8,7,6,5,4,3,2,1,0};
	int len = sizeof(a)/sizeof(a[0]);
	// mySort(a, len);
	mySort1(a, 0, len-1);
	myPrint(a, len);
	
	
	
	return 0;
}