摘要：#include <iostream> template <class elem> void swap(elem a[], int p1, int p2) { elem tmp = a[p1]; a[p1] = a[p2]; a[p2] = tmp; } template <class elem> void print(elem a[], int length) { for (int i = 0; i < length; i++) std::cout << a[i] << ' '; std::cout <& 阅读全文

摘要：#include <iostream>template <class elem>void swap(elem a[], int p1, int p2){ elem tmp = a[p1]; a[p1] = a[p2]; a[p2] = tmp;}template <class elem>void print(elem a[], int length){ for (int i = 0; i < length; i++) std::cout << a[i] << ' '; std::cout << std 阅读全文

摘要：template <class key, class Elem, class keyCompare, class EECompare>class Dictionary{public:virtual void clear() = 0;virtual bool insert(const Elem&) = 0;virtual bool remove(const key&, Elem&) = 0;virtual bool remove_any(Elem&) = 0;virtual bool find(const key&, Elem&) = 阅读全文

摘要：#include <stdio.h>#include <math.h>#include <assert.h>int is_prime(int x){int i, m;assert(x >= 0);if (x == 1){return 0;}m = floor(sqrt(x) + 0.5);for (i = 2; i <= m; i++){if (x % i == 0){return 0;}}return 1;}int main(void){int i, m;scanf("%d", &m);for (i = m - 2; 阅读全文

摘要：template <class type> class link{private:static link<type>* freelist;public:type element;link* next;link* prev;link(const type& a, link* pre = NULL, link* ne = NULL){element = a;next = ne;prev = pre;}link(link* pre = NULL, link* ne = NULL){next = ne;prev = pre;}void* operator new(siz 阅读全文

摘要：通过重载new 和 delete 大大提高内存空间的分配速度。template <class type> class Link{type elememt;Link* next;Link(const type& ele, Link* ne == NULL){element = ele;next = ne;}Link(Link* ne = NULL){next = ne;}}template <class type> class link_list: public Link<type>{private:Link<type>* head;Lin 阅读全文