冒泡排序

//冒泡排序算法#include <iostream>using namespace std;void Bubblesort(int num[],int n){ int i,j,temp; for(i=n;i>0;i--)  for(j=0;j<i-1;j++)  //注意i和j的范围  {   if(num[j]>num[j+1])   {    temp=num[j];    num[j]=num[j+1];    num[j+1]=temp;   }//======================输出冒泡排序的过程   cout<<"第"<<i<<"回  ";   for(int k=0;k<i;k++)    cout<<num[k]<<"  ";   cout<<endl;  }} int main(){ FILE *fin=fopen("8.1.2.txt","r"); int num[80],i=0; while(fscanf(fin,"%d",&num[i])!=EOF)   i++; int n=i; Bubblesort(num,n); for(i=0;i<n;i++) {  if(i%5==0)   cout<<endl;  cout<<num[i]<<"  "; } cout<<endl; fclose(fin); return 0;}