C++类模板实现数组的排序以及增删查

# include <iostream> using namespace std; template <typename T, int n> class aa { private: T a[n]; int len; public: aa(T b[], int l) { len = l; for (int i = 0; i < len; i++) a[i] = b[i]; } void search(T x); // 查询 void sort(); // 排序 void insert(T y, int p); // 插入 void shanchu(T z); // 删除 }; template <typename T, int n> // 类模板 void aa <T, n>::search(T x) { int i; for (i = 0; i < len; i++) if (a[i] == x) { cout << x << endl; break; } if (i >= len) cout << "No" << endl; } template <typename T, int n> void aa <T, n>::sort() { // 冒泡排序 int i, j, s; for (i = 0; i < len - 1; i++) for (j = 0; j < len - i - 1; j++) if (a[j] > a[j + 1]) swap(a[j], a[j + 1]); for (s = 0; s < len; s++) cout << a[s] << " "; cout << endl; } void swap(int& x, int& y) { // 交换 int k; k = x; x = y; y = k; } template <typename T, int n> void aa <T, n>::insert(T y, int p) { if ((p < 0) && (p > len)) return; if (len == n) { cout << "overflow"; return; } int i; for (i = len - 1; i >= p; i--) a[i + 1] = a[i]; a[p] = y; len++; for (int t = 0; t < len; t++) cout << a[t] << " "; cout << endl; } template <typename T, int n> void aa <T, n>::shanchu(T z) { int i; for (i = 0; i < len; i++) if (a[i] == z) break; for (int j = i; j < len; j++) a[j] = a[j + 1]; for (int r = 0; r < len - 1; r++) cout << a[r] << " "; cout << endl; } void main() { int b[] = { 3,5,2,4,8 }; aa<int, 10> w(b, 5); int x, m, n, q; cout << "请输入需要查找的字符："; cin >> x; cout << "查询结果："; w.search(x); cout << "排序结果："; w.sort(); cout << "请输入需要插入的数字和位置："; cin >> m >> n; w.insert(m, n); cout << "请输入删除的数字："; cin >> q; w.shanchu(q); system("pause"); }