自己写的四皇后问题的算法，其中的注释非常的详细，请多指教...

约瑟夫环最终运行文件，适合直接使用者，不必再以来C语言来汇成执行文件。-Josephus final run files, suitable for users, having been formed to C language implementation document.

清华大学数据结构课上实现的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;

射击运动员10发打中90环有多少种可能,递归算法-shooting 10 athletes hit the number 90 ring possible, recursive algorithm

如何以编程方式将数据从ACCESS数据库导出到EXCEL

用栈的形式实现车厢调度,火车入口处的车厢序列编号为1到n-Realizes the compartment dispatch with the stack form,The train entrance compartment sequence serial number is 1 to n

Free JavaScript HTML editö r for web developers

收费系统我的第一个系统-system of a system

C语言编写的栈操作模板。包含栈的9种基本操作，从栈的创建、栈的判断到入栈、出栈操作，以及栈的删除等操作。-C language template stack operation. Stack contains 9 kinds of basic operation, from the stack to create, to determine the stack入栈, a stack operation, and stack operations such as delete.

OLEDB进行数据通讯,应用ATL进行程序编写,具有借鉴意义-OLEDB for data communications, application procedures to the preparation of ATL, with reference

求解线索二叉树中结点前趋和后继的算法以及以相应次序遍历线索二叉树的算法，二叉树的线索化算法的设计-Solving clues to binary tree node before the trend and follow-up algorithm and the corresponding sequence of binary tree traversal algorithm clues, clues to binary tree algorithm design