冒泡排序

#include <stdio.h>
#include <stdlib.h>

void bubbleSort(int * arr, int size)
{
	int i,j,temp;
	for (i = size; i > 1; i--)//扫描个数
		for (j = 0;j < i - 1; j++)//找出最大值
		{
			if (arr[j+1]<arr[j])
			{
				temp = arr[j];
				arr[j] = arr[j+1];
				arr[j+1] = temp;
			}
		}
}

void print(int *arr,int size)
{
	int i;

	for (i = 0; i < size; ++i)
	{
		printf("%d ",arr[i]);
	}
	printf("\n");
}

int main(int argc, char const *argv[])
{
	int arr[] = {2,3,4,1,5,8,6,10,9,7};
	int size = sizeof(arr)/sizeof(arr[0]);
	bubbleSort(arr,size);
	print(arr,size);
	return 0;
}