各大排序算法再次整理——冒泡排序

#include<stdio.h>
#include<iostream>
using namespace std;

void Bubble_sort(int a[], int n)
{
int i, j;
int temp;
//所有排序完整
for (i = 0; i < n-1 ; i++)
{
for (j = 0; j < n-1-i ; j++)
{
if (a[j]>a[j+1])
{
temp = a[j];
a[j] = a[j+1];
a[j+1]= temp;
}
}
}
//一趟排序后的结果
/*    for (j = 0; j < n-1; j++)
{
if (a[j]>a[j+1])
{
temp = a[j];
a[j] = a[j+1];
a[j+1] = temp;
}
}*/
}
int main()
{
int a[101];
int n,i,j;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
Bubble_sort(a, n);
for (i = 0; i < n; i++)
cout << a[i] << " ";
cout<<endl;
return 0;
}