冒泡排序

#include <iostream>using namespace std;void Sort(int a[], int n){while(true){int flag = 1;for(int i = 1;i <= n;i++){if(a[i-1] > a[i]){int temp = a[i];a[i] =  a[i-1];a[i - 1] = temp;flag =0;}}if(flag == 1)break;}}void show(int a[],int length){for(int i = 0;i < length;i++){cout<<a[i]<<endl;}}int main(){int a[] = {32,64,35,8,4,16,7,5,45};int length = sizeof(a)/sizeof(a[0]);Sort(a,8);show(a,length);    return 0;}