ADO直接读取数据库的编程实例

Bellman-Ford算法 是最短路径算法的一种-Bellman-Ford algorithm is the shortest path algorithm of a

利用栈的方式完成车厢调度,数据结构的实习题目,已完成基本内容.-Completes the compartment dispatch using the stack way,Construction of data practice topic,Has completed the basic content

《数据结构与算法入门导学》 第一章 概论 第二章 线性表 第三章 栈和队列 第四章 串 第五章 多维数组和广义 表 第六章 树 第七章 图 第八章 排序 第九章 查找 第十章 文件-" Introduction to Data Structures and Algorithm Study I." Introduction to Chapter II Chapter III Chapter linear stack and queue Chapter IV Chapter V multi-dimensional array of strings and generalized tree table Chapter VI Chapter VII Chapter VIII of the sort ninth plan Chapter X Chapter document search

是数据结构书上的算法，都是比较经典的实现。-data structure is the book algorithm, which is a more classic realized.

本演示程序演算约瑟夫环问题，人数n应为任意的，首先应输入一个值赋给初始报数上限m，程序应能自动保存出列人的序号和将出列的人所持的密码赋给m，再次作为报数上限，如此循环，直至所有人都出列为止。-The demo program Joseph Central calculus problem, the number n should be arbitrary, we must first enter a value assigned to the initial reported that the maximum number of m, the procedure should be able to automatically save a list of the serial number of people and held out the password given to m, again as reported maximum number of such cycles, until all that far out.

选择AL2格式文件，修改代码可以插入txt文件等等，解析文件赋值实体，格式固定，转而插入ORACLE数据库记录

该程序用动态规划解决经典的背包问题,虽然它的效率与分支定界法比起来,还是有一定的差距,但它的简洁性却是无与伦比的.-the program with dynamic programming solution to the classic knapsack problem, although its efficiency and branch and bound over, there is still a certain gap, but its simplicity is incomparable.

&公共静态字节[]加密（SqlString s）

通用数据库管理的VC程序-common database management procedures VC

这是一个用面向对象方法实现多项式四则运算的源程序，算法高效，用到很多数据结构。压缩包里面只是源程序文件，在vc中运行。-This is an object-oriented method polynomial four Operational source, efficient algorithm that uses a lot of data structure. Compressed only source files inside the vc run.