冒泡排序:
#include <iostream>
using namespace std;
int main()
{
int a[10] = { 3,1,4,5,2 };
for (int i = 1; i <= 4; i++)//整个过程执行n-1趟,五个数字排序即四趟
{
for (int j = 0; j < 5 - i; j++)
{
if (a[j] > a[j + 1])
{
int temp = a[j];
a[j] = a[j + 1];
a[j + 1] = temp;
}
}
}
for (int i = 0; i < 5; i++)
{
printf("%d ",a[i]);
}
return 0;
}