冒泡法排序

#include <iostream>using namespace std;int main(){int a[5]={43,4,3,432,42};int n,i,q,t;for (n=1;n<=4;++n)for(i=5-n;i>=1;--i)for (q=0;q<4;++q){if (a[q]>=a[q+1]){t=a[q];a[q+1]=t;                a[q]=a[q+1];}}for (i=0;i<=4;++i){cout<<a[i]<<endl;}return 0;}