用循环链表实现约瑟夫问题

Fibonacci函数-Fibonacci function

皇后控制问题 皇后控制问题-Queen

平分算法来查找任何方程的多个根元素。它以输入的任何命令的多项式，给你的多项式的全部根。

数据结构1800例题与答案 我想对大学生很有用啊-data structure with 1,800 examples, I would like to answer students useful ah

销售和库存系统描述从库存中获得的关于产品的销售以及购买产品的客户之间的销售

一个简单的LISP算术表达式计算器。 简单LISP算术表达式定义如下： （1）一个0....9的整数 （2）（运算符 表达式 表达式） 例如，6，(+45),(+(+25)8)都是表达式，其值分别为6，9，15.-LISP a simple arithmetic expression calculator. LISP simple arithmetic expressions are defined as follows: (1) a 0 .... 9 integer (2) (expression operator expression) for example, 6, (+ 45), (+ (+ 25) 8 ) are expressions, and its value, respectively 6,9,15.

子集和问题.rar:这是我学算法设计时的总结,包括定长和不定长做法(也就是回朔法,剪枝限界),当然也包括穷举法.-subset and problems. Rar : This is my learning algorithm design at the conclusion, including fixed-length and variable length approach (that is, back to Schomburg, pruning Bound), which of course includes exhaustive law.

一套采用php+mysql数据库方式运行的多用户网上商城系统，具有安全、负载量高，访问迅捷的特点，能与论坛、博客、CMS等系统整合并支持一站登陆。系统内置贝宝、支付宝、快钱等在线支付网关以及QQ、旺旺、雅虎通即时网络通讯工具.-Adopted a set of php+ Mysql database running multi-user online mall system with safe, high-load, quick visit to the features with forums, blog, CMS, such as systems integration and support the one-stop landing. PayPal embedded system, AliPay, quick money, such as online payment gateways, as well as QQ, Wangwang, Instant Messenger network communication tools.

清华大学数据结构课上实现的B+树，设计一个4阶B+树，包括： (1) 叶子的每个记录应该包括4字节（long）关键码值和60字节的数据字段(存储文件名等，可以自定)，设每个叶子可以存储5条记录，而内部节点应该是关键码值/指针对。此外，每个节点还应该有指向同层下一个节点的指针、本节点存储的关键码数等； (2) 此4阶B+树应该支持插入、删除以及根据给定关键码值进行精确检索与关键码范围检索； (3) 显示（打印）此4阶B+树的生长(含删除节点)过程实例；-Tsinghua University class data structure to achieve the B-tree, the design of a B-tree four bands, including : (a) the leaves of each record should include 4-byte (long) key code value and 60 gigabytes of data fields (document storage, etc., can be set), set up each leaf store five records, and internal nodes is the key code value/means against. In addition, each node should have the same point under a layer of the target node, the node storage key code number; (2) The B-tree four bands should support the insertion, deletion and with the given key code value accurate retrieval and key codes scope retrieval; (3) Display (Print ) This four bands B-tree growth (including the deletion of nodes) process examples;

这是一个完整的库存管理系统，并配备了完整的源代码。 这个代码学习起来很有趣。