冒泡排序算法

#include <iostream>
using namespace std;

int main(int argc, const char **argv)
{
	int arr[] = {1,2,3,4,5,6,7,8,9,10};
	int i = 0;
	for (i = 0; i < sizeof(arr)/sizeof(arr[0])-1; i++)
	{
		for(int j = 0; j < sizeof(arr)/sizeof(arr[0])-i-1; j++)
		{
			if (arr[j] < arr[j+1])
			{
				int temp = arr[j];
				arr[j] = arr[j+1];
				arr[j+1] = temp;
			}
		}
	}
	for (i = 0; i<sizeof(arr)/sizeof(arr[0]); i++)
	{
		cout << arr[i] << " ";
	}
	cout << endl;
	return 0;
}