一元多项式相加数据结构算法

数据结构课程设计,表达式,用C语言实现,难度系数较高-data structure curriculum design, expression, using C language, the higher the coefficient of difficulty

图的表示 数据结构-map indicates that the data structure

K路归并算法 * 本程序用来实现K路归并算法 * 在Turbo C2.0编译器下编译通过 * 算法过程中 * K由用户输入 * 用户选择需要归并的数据的个数 * 由程序生成随机数据，数据结构为链表，并展示给用户 * 然后程序告诉用户需要增加的虚节点的个数 * 并把虚节点加入到链表中去，最后进行归并 -K Road merge algorithm* This procedure used to realize the way merging algorithm for K* in Turbo C2.0 compiler compiler under the process through the* algorithm* K* by the user input the user select the number of merging the data* generated by the random data , data structure for the list, and display to the user* and then the procedure to tell the user the need to increase the number of virtual nodes and virtual nodes* added to the list going, and finally to merge

KRUSKAL算法-KRUSKAL Algorithm

n后问题,实现n后问题的求解,并且可以输出最有解-n, n after realizing the problem solving, and can export most Solution

VC++编写的通讯录实例，实现简单数据库功能 （不用后台数据库支持）-VC prepared directories example, to achieve a simple database function (no background database support)

C++面试试题，值得一看-C interview questions, the eye-catcher

用vb6.0实现GIS的重要算法TIN的生长算法。-GIS using vb6.0 an important method to achieve the growth of TIN algorithms.

描述 问题描述： 给定一个只包含数字[0..9]的字符串，求使用字符串中的某些字符，构建一个能够整除15的最大的整数。 注意，字符串中的每个字符只能使用一次。 编程任务： 求由给定字符串构建的能够整除15的最大整数。-Description of the problem description: Given a contain only numbers [0 .. 9] of the string, seeking to use some of the characters in the string, one can build the largest integer divisible by 15. Note that the string for each character can only be used once. Programming task: seeking from the given string that can build the largest integer divisible by 15.

二叉树有三种遍历方法，引用树的概念实现遍历-There are three methods of tree traversal, invoke the concept of tree traversal realize