c4.5matlab

前k条最短路径（KSP）算法在国内鲜有研究，本压缩包中文献整合了自1971年此问题被提出后几十年来的论文共25篇。 其中以Martin先生的删除（Delelte）算法与Yen先生的背离（Devation）算法为主。 其中所有文献均来自网络。含有两篇中文文章以及23篇英文文章。 算法的复杂度基本控制于O(logn)内-Pre-k shortest paths (KSP) algorithm in the domestic few studies in the literature in this compressed package integration since 1971, this issue has been moved for several decades a total of 25 papers. Among them, Mr. Martin removed (Delelte) algorithm and Mr. Yen departure (Devation) algorithm is based. In which all documents are from the network. Contains two Chinese articles and 23 articles in English. The complexity of basic control algorithms in O (logn) in

NexusDB manual (chm format)

用短小的c语言编出了精湛的通讯簿，值得一看 包含了插入 删除 排序等一系列操作。-notebook

包含图的遍历和线性链表两个内容，压缩文件里含有设计报告-Contains the graph traversal and linear chain of two elements, compressed file contains the design report

链表与数组的数据交换 数据结构的实验基本内容 讲数组中的数存进链表-chain with an array of data exchange data structure of the basic contents of the array of speakers for storing Chain

堆栈实现C++,以VC++环境为准——逍遥大洋至上(The stack of the C++, VC++ environment will prevail)

这是一个生成全排列的程序,采用最小变化算法,相邻两个序列之间只有两个数的次序不同,每交换两个数,便形成一个新的序列,速度非常快.-This is a whole generation with a procedure using the smallest change algorithm sequence between two adjacent only two of several different order every two exchanged a few, it will lead to a new series, very fast.

运用二叉树对欧式看涨亚式期权的定价，详细说明(Use binary European call for Asian options pricing)

数值计算源代码，包括二分法，弦截法，龙贝格算法，下山法，牛顿迭代法-numerical source code, including the dichotomy, chord sheet, Lung Bergh algorithm, the mountain, the Newton iterative method

演示了由MDB数据库生成HTML表格文件的演示效果。-demonstrated by the MDB database HTML document forms the demonstration effect.