Halfopen的专栏

#include using namespace std; class Term {     int coef;     int exp;     Term *link;     friend ostream& operator     friend class Polynominal; public:     Term(int c,int e):coef(c),exp(e

二叉搜索树、B树、B+树、B*树

int readInput(ElemType *&a) { int length,n; FILE*input; input = fopen("input.txt","r"); fscanf(input,"%d",&length); a = (int *)malloc( sizeof(int)*length ); for(n=0;n<length;++n)fscanf(input,"%d

void transpLinkList(LinkList *&L) {    LinkList *p,*temp = L->next,*f;     p = temp->next;    //store temp->next     temp->next = NULL;     f = temp;     //printf("%p %p %p\t",f,temp,p);     whi

/* function:Expression value----main_function_cpp ** time:2014-10-09- 16:04 ** author:halfopen ** version:1 */ #include #include #include #include #include "LiStack.h" #include "exp.h" #define PI

/* ** Expression value ** time:2014-10-07-13:53 ** author:halfopen ** version:1 */ #include #include #include "LiStack.h" void InitStack( LiStack *&s) { s = (LiStack *)malloc( sizeof(LiStack)); s->

/*     time:2014-10-06 00.17     author:halfopen     version: 1 */ #include #include typedef struct eNode{     int b;     int e;     eNode *next; }LinkList; void InitList( LinkList *

void ConList(LinkList *&ha, LinkList *&hb, LinkList *&hc) {    LinkList *pa = ha->next,*pb = hb->next;     while( pa->next != ha)pa = pa->next;     while( pb->next != hb)pb = pb->next;     //pri

void LocateNode(DLinkList *&L, ElemType x) {    DLinkList *p = L->next, *t,*a,*b,*c;     while(p !=NULL)     {    //printf("1,%p,%d f:%d next,%p\n",p,p->data,p->freq,p->next);         //getchar();

R-tree 转自 http://blog.youkuaiyun.com/v_JULY_v/article/details/6530142 简介1984年，加州大学伯克利分校的Guttman发表了一篇题为“R-trees: a dynamic index structure for spatial searching”的论文，向世人介绍了R树这种处理高维空间存储问题的数据结构。本文便是基于这篇论文写作完成的