1.选择排序
#include <iostream>
using namespace std;
#include <cstdio>
int main()
{
int i,j,n,a[100];
cin >> n;
for (i=0;i<n;i++)
{
cin >> a[i];
}
for (i=0;i<n;i++)
{
for (j=i+1;j<n;j++)
{
if (a[i]>a[j])
swap(a[i],a[j]);
}
}
int c=0;
for (i=0;i<n;i++)
{
if(!c)
{
cout << a[i];c++;
}
else
cout << " " << a[i];
}
cout << endl;
return 0;
}
2.冒泡排序
#include <iostream>
using namespace std;
#include <cstdio>
int main()
{
int i,j,n,a[100];
cin >> n;
for (i=0;i<n;i++)
{
cin >> a[i];
}
for (i=0;i<n;i++)
{
for (j=0;j<n-i-1;j++)
{
if (a[j]>a[j+1])
swap(a[j],a[j+1]);
}
}
int c=0;
for (i=0;i<n;i++)
{
if(!c)
{