冒泡排序

#include<iostream>using namespace std;void swap(int* a,int* b){int temp=*a;*a=*b;*b=temp;}void main(){int a[]={3,5,7,9,1,4,7,0,10,38};int length=sizeof(a)/sizeof(int);int i;int j;for(i=0;i<length;i++){for(j=length-1;j>i;j--){if(a[j]<a[j-1])swap(&a[j],&a[j-1]);}}for(i=0;i<length;i++){cout<<a[i]<<endl;}}