记录一个最简单的排序算法
#include <iostream>
using namespace std;
void Bloop(int num[],int size)
{
for (int i = 0; i < size-1; i++)
{
for (int j = 0; j < size-1-i; j++)
{
if (num[j]>num[j+1])
{
int temp = num[j];
num[j] = num[j+1];
num[j+1] = temp;
}
}
}
}
int main()
{
int Num[] = {12,43,21,33,1,89,77,53 };
int size = sizeof(Num) / sizeof(int);
Bloop(Num,size);
for (int i = 0; i < size; i++)
{
cout << Num[i] << endl;
}
getchar();
return 0;
}