K阶菲波那契算法，运用环形队列实现，空间是K+1

货郎担限界算法 c语言-traveling salesman Bound algorithm language c

该源码功能是实现赫夫曼编码，即构造最优二叉树，是字符界面的，自我感觉做的还不错，调试通过的，绝对好用-The source function is to realize Huffman coding, that is, the optimal tree structure is a character interface, and the sense of self, to do good, debugging adopted, the absolute ease of use

用delphi实现的各种排序算法，图形界面，可实现插入排序、交换排序、选择排序、合并排序以及基数排序-used to achieve the various sequencing algorithms, graphical interface, insert can be realized, in order of ranking exchange, SELECTION SORT, the merger sort of base sequencing

枚举lan中的所有数据库实例的d-enumeration of all database instances d

编写了一个关于图的操作的应用程序，可以自己手动输入图的节点和节点的关系，然后可以进行查找节点，求节点的出度和入度，求最短的路径等-Prepared a map of the operation on the application, you can manually enter their own graph of the relationship between nodes and nodes, and then can search the node, and the out-degree and node-degree, and the shortest path, etc.

在设计会计软件时,常常要把小写金额转换为大写金额,通过本例,你只要输入小写数字,即可转为大写金额.-accounting software in the design, it is often the amount should lowercase to uppercase conversion rates, through the cases, as long as you input lowercase figures, the amount can be converted to uppercase.

este archivo permite la creacion de formularios de forma dinamica, ademas obtener su valor y gurdarlo en una base de datos

能对数据库进行维护，包括内容和结构 但是数据库中的表要求有主键 且是自动增长字段-Able to carry out maintenance on the database, including the content and structure of the table but the database requires the primary key and is auto-growth fields

资源描述 有两种方法：一种没有学分排序，另一种考虑了学分排序，较推荐栈中排好序的方法，贪心更完全 测试数据文本： C1 程序设计基础 # 2 C2 离散数学 C1 3 C3 数据结构 C1,C2 4 C4 汇编语言 C1 3 C5 语言的设计和分析 C3,C4 2 C6 计算机原理 C11 3 C7 编译原理 C3,C5 4 C8 操作系统 C3,C6 4 C9 高等数学 # 7 C10 线性代数 C9 5 C11 普通物理 C9 2 C12 数值分析 C1,C9,C10 3

题目：串基本操作的演示 含有测试结果和函数关系调用图-Title: string containing the basic operation of the demonstration test results and the function call graph