Oracle BerkeleyDB

算法导论(中文版)，讲述了现代计算机常用数据结构和算法-this book intrdduce the basic algorithm,the language is chinese

线性表常用算法集合，含所有线性表基本的算法，与吴伟民编的数据结构书完全配套，用TC实现，经过运行。-linear algorithm commonly used pool table, table containing all the basic linear algorithms, and Xiulan WU Weimin series of the data structure was fully complementary with TC realization, after running.

问题描述： 给定n个石子，其重量分别a1,a2,a3...an,要求将其划分成m份，每一份的划分费 义为这份石了中最大重量与最小重量的差的平方。总划分费用等丁m份划分费用之和。 编程任务 对于给定的n个石子，求一种划分方案，使得总划分费用最小。-Description of the problem: Given n-stones, its weight, respectively a1, a2, a3 ... an, asked that it be divided into m copies, each of the division of costs defined as the weight of the stone of the largest and the smallest weight difference the square. Small m the total costs were divided into the sum of the cost. Programming tasks for a given n-stones, seek a kind of division, making the total cost of the smallest division.

这是一个完整的学生管理系统，就奖学金那一模块需添加一个窗口判断。非常适合学习以及用于毕业设计。

本程序集合了数据结构8种主要的排序方法：插入排序、冒泡排序、选择排序、快速排序、希尔排序、堆排序、归并排序、基数排序。-the procedures set of data structure of the eight major sequencing method : Insert ranking Bubble Sort, select, in order of Quick Sort, Hill sequencing, heap sort, merge, in order of ranking base.

按前序遍历序列创建二叉树，并中序遍历二叉树、求二叉树高度-by creating a binary tree traversal sequence, and which preorder binary tree, seeking binary tree height

程序实现了带表头单链表的最基本操作，包括创建链表，查询数值，插入结点，删除结点，链表分解，将单链表变为循环链表。并附有详细的注释和实验报告。-Procedures to achieve a single-list header with the most basic operation, including the creation of list, query value, insert node, delete node, chain decomposition, into a single cycle of list list. Together with detailed notes and experimental reports.

你用过吗?那个是VF编写的,而我是用VC++编烈写的!搜索速度明显比作者原版更快了,还包含了重要的诗词数据库,代码注释详尽.-You used

双链表的一个简单实现，双链表的插入也删除-Double-linked list to achieve a simple, double-linked list insertion also delete

数据结构习题集答案，经多次修改而成，比答案册还要清楚简单。-data structure answer to the questions set by several revisions, but clearly the answer List simple.