分支定界法可以求解小规模的TSP问题,这个例子是用vc编写的

C 语言写的字符串处理方法 依据数据结构的方法编写的关于串处理的各个函数-Written in C language string handling methods based on the data structure prepared by the various string handling functions

c程序各种经典算法-various classical algorithm

是关于好几种有用的排序算法的描述很有用的-on several useful algorithm description very useful

穷举密码算法 /在许多情况下我们需要穷举组合的算法，比如密码词典。 //这个算法的关键是密码下标进位的问题。 //另外本例子中的写文件语句效率比较低，为了降低算法复杂度没有优化。 //如果要提高写文件的效率，可以使用缓冲区，分批写入。-Exhaustive Cipher/In many cases we need to exhaustive combinations of algorithms, such as the password dictionary.// This algorithm, the key is password subscript binary problems.// Another example of this statement to write a document relatively low efficiency, in order to reduce the algorithm complexity is not optimized.// If you want to improve the efficiency of writing documents, you can use the buffer, write in batches.

vb写得进销存，解压稍微调试可用，多多下载-vb write Invoicing, extracting a little debugging available, a lot of downloads

一个简易的ACCESS的源程序 VB源码-数据库-ACCESS a simple VB source code- database

Generating next numbers in SQLServer should not be a problem. But problems arise when a customer asks for different types of next numbers that you cannot generate directly from SQL Server. This brief article describes how you would tackle this problem in different scenarios.

数据结构十日谈 第一日 绪论 第二日 算法的描述和分析 第三日 线性表 第四日 栈和队列 第五日 串 第六日 数组 第七日 树 第八日 图 第九日 查找 第十日 排序-Preface the first day of the second day of algorithm for the third day of the description and analysis of linear table queue stack and its fifth day of the fourth day running sixth string array eighth seventh day of the tree map to sort第十日search第九日

KRUSKAL算法-KRUSKAL Algorithm

/*数字三角形问题 问题描述： 给定一个由n行数字组成的数字三角形如下图所示。试设计一个算法,计算出从三角形的顶至底的一条路径,使该路径经过的数字总和最大。 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5 编程任务： 对于给定的由n行数字组成的数字三角形,编程计算从三角形的顶至底的路径经过的数字和的最大值-/* Digital triangle Issue Description : given an OK by the number n of triangular figures shown in the diagram below. Design of a test algorithm, calculated from the top of the triangle to the end of a path, the path through the largest sum of the figures. 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5 programming tasks : for a given n line by the number of digits triangle, triangle programming calculated from the top to the bottom of the path through the figures and the maximum