Java data structures and algorithms (second edition)

表达式求值，c语言，有运行bug,可供研究使用。-expression evaluates, c language, and running bug, available for study.

迷宫的又一解法。该算法简单、实用、可读性强，是学习递归和回溯很好的例子。-maze of another solution. The algorithm is simple, practical and readable study is recursive and backtracking good example.

一个教师信息管理的Visual Basic源码-a teacher information management Visual Basic source

包括字符串反转， 链表反转， 判断两个数组中是否存在相同的数字， 判断链表是否存在环， 找出单向链表的中间结点， 如何判断一棵二叉树是否是平衡二叉树， strstr()的简单实现，-Including the string reversal, list reversal, to determine the existence of two different array of figures to determine the existence of ring list, find the middle of a one-way linked list nodes, how to determine whether it is a balanced binary tree Binary Tree, strstr () to achieve a simple,

pb做出的outlook界面框架,可以直接用在管理信息系统中来使用.-pb"s outlook interface framework, can be directly used in the management information systems to use it.

数据结构与算法综合资料库.CHM 包含经典的数据结构、常用算法、以及c++学习资料等，全是经典的东西-General data structures and algorithms library. CHM contains classic data structure, commonly used algorithms, as well as the c++ learning materials and so on, all things classic. . .

BDijkstra算法的java实现。使用工具是eclipse，java1.4以上-BDijkstra algorithm to achieve the java. Eclipse is the use of tools, more java1.4

FastDb是高效的内存数据库系统，具备实时能力及便利的C++接口。FastDB不支持client-server架构因而所有使用FastDB的应用程序必须运行在同一主机上。FastDB针对应用程序通过控制读访问模式作了优化。-FastDb is efficient memory database systems, with real-time capability and convenience of the C interface. FastDB not support client-server structure which all use of the application process FastDB Order must be running in the same host. FastDB against applications by controlling access mode was reading optimization.

Java写的TDS协议(JDBC/ODBC)实现-Java to write the TDS protocol (JDBC/ODBC) to achieve

双向循环链表节点：数据域+指针域指针域：一个指针指向前一个同类型节点，另一个指针指向后一个同类型节点（1）设计节点struct db_node{int data;struct db_node * prev;struct db_node * next;};（2）创建空链表//创建了一个只有头节点的双向循环链表，返回头节点的地址struct db_node * create_db_list(void){struct db_node * phead = (struct db_node *)malloc(sizeof(struct db_node));if(phead == NULL)exit(-1);else{phead->next = phead;phead->prev = phead;}return phead;}（3）制造新节点//制造新节点，返回新节点的地址struct db_node * make_db_node(int value){struct db_node * pnew = (struct db_node *)malloc(sizeof(struct db_node));if(pnew == NULL)printf("malloc failed! ");else{pnew->data = value;pnew->next = NULL;pnew->prev = NULL;}return pnew;}（4）插入节点//把pnew指向的节点插入到头节点的前面，也就是整个链表的末尾bo