8641 冒泡排序 .txt

#include<iostream>
using namespace std;
template<class T>
void MaopaoSort(T *array,const size_t n)
{
   T tmp;
   int flag,i,j;
   for(j=0;j<n-1;j++)
   {
 flag=0;
     for(i=0;i<n-j-1;i++)
   if(array[i]>array[i+1])
   {
   tmp=array[i];
   array[i]=array[i+1];
   array[i+1]=tmp;
   flag=1;
   }



       for(int k=0;k<n;k++)
      cout<<array[k]<<" ";
       cout<<endl;

    if(flag==0) break;
 
   }
}