C++ 类模板 冒泡排序

#include
using namespace std;
//类模板
template
class vector
{
public:
void sort(T a[],int n);

};
//排序
template
void vector::sort(T a[],int n)
{
T temp;
for(int i =0; i < n; i++)
for(int j=0;j if(a[j] >a[j+1])
{
  temp = a[j];
  a[j] = a[j+1];
  a[j+1] = temp;
}

for( i = 1; i <=5; i++)
cout< }

void main()
{
    

double data1[5] = {5.5,4.4,3.3,2.2,1.1};
cout<<"排序前数组各元素为："< for( int i = 0; i < 5; i++)
cout< cout< vector s1;
cout<<"排序后数组各元素为："< s1.sort(data1,5);

cout<

char data2[5] = {'h','b','d','e','a'};
cout<<"排序前数组各元素为："< for( i = 0; i < 5; i++)
cout< cout< vector s2;
cout<<"排序后数组各元素为："< s2.sort(data2,5);
//for( i = 1; i <=5; i++)
//cout< cout<

}