客户关系管理系统,可以进行一些简单的客户关系管理

算法类，合并排序的源代码，来自算法导论上的-Algorithm category, the combined ranking of the source code, from the Introduction to Algorithms

实现了二叉排序树的所有功能 建立，增，删，改，查 -Achieved a binary sort tree all the features of the establishment, increase, delete, change, check

这是我本人编写的一个32位定点小数运算的函数库。对于没有浮点运算器的场合，可以提供进行小数运算的一种途径-This is my prepared in a 32-bit fixed point decimal computing functions. For no floating point unit occasions, it can provide for fractional arithmetic, as a way to

罗马支配数的算法，对广义Petersen图P(n,2)的罗马支配数进行了研究-Rome dominated the number of algorithms, on the generalized Petersen graph P (n, 2) the number of Roman domination of the research

金华门禁系统数据库脚本,涵盖了门禁,售饭,人力资源管理等-Jinhua Access Control System database scripts, covering doors, EL keyboard Illumination, human resource management, etc.

二叉树的动态链表存储结构及表示，二叉树的三种遍历算法（递归和非递归两类）运用二叉树三种遍历的方法求解有关问题-Binary tree structure and the dynamics of linked list is stored, said three kinds of binary tree traversal algorithms (recursive and non-recursive types) the use of three kinds of binary tree traversal of the method for solving the problem

不带头结点的链式堆栈类,1、 定义并实现不带头结点的链式堆栈类，除构造和析构函数外，成员函数还有入栈、出栈、取栈顶元素、判断堆栈是否非空，头文件为“nohead_LinStack.h”。-node does not take the lead in the category of chain stack, 1, and the definition does not take the lead in realizing the chain nodes stack category, In addition to construction and destructor function, the members also function stack, stack up and stack elements for judging whether non-empty stack, The first document as "nohead_LinStack.h."

生成数据库链接和sql语句的工具,帮助不熟悉sql的网友应用sql-generation database links sql statement and the tools to help not familiar with the sql netizens application sql

数据结构的 用有序表实现集合的基本功能~交集 并集 插入 删除~界面美观~可操作性强-data structure using the table to achieve an orderly set of basic function-set intersection and inserted delete ~ ~ operable aesthetic interface strong

简单的演示,N的大小可以改变的,而且这个程序的速度还可以, 比以前我用递归写的那个快多了.如果N改得太大输出会有问题， 因为我用到gotoxy的,这个程序主要是练一个算法-simple demonstration, N size can be changed, but the rate of this procedure can also, than in the past I used to write a recursive that quicker. If N is too big change in exports, gotoxy because I used, the process is mainly a training algorithm