C++函數(shù)模板的冒泡排序#include<iostream>using namespace std;template <class M>M mob(M n){int li[n];for(int i=0;i<n;i++)for(int j=n-1;j>i;j--)if(li[j-1]>li[j]){int temp=li[j=1];li[j-1]=li[j];li[j]=temp;}/* cout<<"the result is:"<<endl;for(int k=0;k<5;k++)cout<<li[k]<<"";*/}int main(){ int h;int l[h]={44,45,84,56,5};cout<<mob(h)<<" ";}