用C++编写一个使用类模板对数组进行排序、查找和求元素和的程序

#include
using namespace std;

//类模板
template
class vector
{
public:
void sort(T a[],int n);
T sum(T a[],int n);
int search(T e, T a[], int n);
};

//排序
template
void vector::sort(T a[],int n)
{
T temp;
bool exchange;
for(int i = 1; i < n; i++)
{
exchange = false;
for(int j = n-1; j >= i; j--)
if(a[j] < a[j-1])
{
temp = a[j]; a[j] = a[j-1]; a[j-1] = temp;
exchange = true;
}
if(!exchange)
return;
}
}

//求和
template
T vector::sum(T a[],int n)
{
T sum = a[0];
for(int i = 1; i < n; i++)
sum += a[i];
return sum;
}

//查找
template
int vector::search(T e, T a[], int n)
{
for(int i = 0; i < n; i++)
if(a[i] == e)
return i;
return -1;
}

void main()
{
int data[5] = {5,4,3,2,1};
vector obj;

cout<<"数组和为："< cout<<"数字4在数组中的位置是："<
cout<<"排序前数组各元素为："< for(int i = 0; i < 5; i++)
cout< cout<
cout<<"排序后数组各元素为："< for(i = 0; i < 5; i++)
cout< cout<}

#include
#include
#include

using namespace std;

template class handle_array {
private:
T *arr;
int length;
public:
explicit handle_array()
{
}
handle_array(int n)
{
length = n;
arr = new T[n];
memset(arr, 0, sizeof(T)*n);
}
handle_array(T *p, int n)
{
length = n;
arr = new T[n];
for (int i=0; i arr[i] = p[i];
}
void sort();
int locate(T x);
T sum();
void print();
virtual ~handle_array()
{
delete []arr;
}
};
template
void handle_array::sort()
{
T temp;
for (int i=0; i for (int j=i+1; j if (arr[i] > arr[j]) {
temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
template
int handle_array::locate(T x)
{
int index = -1;
for (int i=0; i if (arr[i] == x) {
index = i;
break;
}
return index;
}
template
T handle_array::sum()
{
T sum=0;
for (int i=0; i sum += arr[i];
}
template
void handle_array::print()
{
for (int i=0; i cout << arr[i] << ' ';
cout << endl;
}

int main()
{
int a[] = {1991, 8, 5};
double b[] = {1990, 8, 25};
handle_array int_array(a, sizeof(a)/sizeof(a[0]));
int_array.sort();
int_array.print();
handle_array double_array(b, sizeof(b)/sizeof(b[0]));

return 0;
}