这个是Hilbert曲线的实现算法,可以具体演示出每级曲线的绘制过程,最多可实现8级曲线的绘制....

1. 输入字符序列，建立二叉链表。 2. 中序遍历二叉树：递归算法。 3. 中序遍历二叉树：非递归算法。 4. 求二叉树的高度。 5. 球二叉树的叶子个数。 6. 将二叉链表视为森林的孩子兄弟链表，计算森林中叶子个数。 7. 建立中序线索二叉树，并实现中序遍历。 8. 借助队列实现线索二叉树的层次遍历。 -tree

This a simple database management system. It doesn t use any other code (i.e. ODBC, ADO, etc.) and has it s own database file format. I wrote it because I found the other DBMSs code too bulky and hard to debug. It s designed for small applications and I doubt it could handle anything on a large scale. A sample program included in the .zip shows how everything works. The database project is a library project, so you ll have to compile and link with the .lib file to get everything working. Pros: - You have the source code so you know exactly what it is doing - Database files are very small - Small and fast code Cons: - Can t handle large amounts of records (more than 65000ish) - Doesn t support SQL (you have to search the database by cycling through the records and testing them against your constraints) - Each database file can only have one table. -This a simple database management system. It doesn t use any other code (i.e. ODBC, ADO, etc.) and has it s own database file format. I wr

该程序能实现的功能，若活动图有回路则无法计算出关键路径，即解决了判断工程的可行性问题。通过对工程活动的输入，可以建立任意的AOE网进行判断。对于输入的网，可以计算出每个活动的最早开始时间，最迟开始时间和全工程可以完成的最早时间，并找出关键路径和关键活动。-the program can achieve the functional, if a circuit map activities can not be calculated critical path, that is a judgment to resolve the feasibility of the project. Right through the importation of construction activities, we can establish arbitrary judgment AOE network. The network for the importation can be calculated for each of the earliest start time, the latest starting time and the entire project will be completed in the first time, and identify key and critical path activities.

db2建库代码和开发文档 帮助初学者更好的学习db2-db2 database code and the development of documentation to help beginners better learning db2

可能是最快的排序算法.源代码和演示文件.-probably is the fastest sorting algorithms. Source code and presentations.

ssd5 exercise 4 ssd5 exercise 4 ss d5 exercise 4 -ssd5 exercise 4 ssd5 exercise 4 ssd5 exercise 4 ssd5 exercise 4

基于数据结构的相关知识点，构造的基数排序-Knowledge-based data structure point of radix sort

Editor 的检讨后，你会得到 0 10 CF 硬币。您的源代码，你会得到更多的 CF 硬币质量越好。请仔细填写以下各节。

数据结构中的基本问题-the basic question in data structure.

演示Kruskal算法和Prim算法 集合的并,元素查找的操作及应用 说明: 代码均在vc++6.0环境下编译均通过 在非VC++6.0环境下编译请去掉头文件 windows.h 和函数 end() -Demo Kruskal algorithm and Prim algorithm and collection, elements of the search operation and application notes: code in vc++ 6.0 compiler environment through in non-VC++ 6.0 compiler environment please go to the U-turn paper windows.h and function end ()