Realization of dynamic programming to find the number of columns between the two...

闹钟程序-clock procedures

经典的摸版操作程序.下载的是用C++编写的原代码-confused version of the classic operating procedures. Downloading is the preparation of the original C code

该程序实现对一维数据轴上的最临近点的求解问题 采用方法：传统方法2:先排序，然后一次线性扫描，得到最近距离，时间复杂性O（nlogn）-the process of achieving a dimensional data axis near the point of the methodology used to solve the problem : The traditional two methods : first order, and then a linear scan, recently received distance, time complexity of O (nlogn)

为VFP编写的一个采购管理系统-VFP prepared for a procurement management system

推选一名办公室主任。假设有10名候选人准备参与竞选。希望编写一个程序，输入一组选举人的投票信息，统计每 个候选人的得票数目及选举结果。 -Selection of a Director of the Office. Assumptions have 10 candidates ready to participate in the election. Hope that the preparation of a program, enter a group of electors voting information, statistics the number of votes each candidate and the election results.

INNO Setup5.36源码，很不错的-INNO Setup5.36 source code, very good,,,

virsual 386系统的设计(尚未完全)-virsual 386 system design (not yet in full)

一个网络电话C++build-a telephone network build C

首先，我们知道B树的主要元素是所谓的信息节点（node），每个数据节点都包含一些信息，以及其他指向节点的数据指针（pointer）。节点间的信息连接到分支上，即分支和叶子（叶子）的末端，假设信息开始插入的顺序如下：1、2、3、4、5、6。在B树上按照以下规则植树。

这是我的java讲座老师的课件，入门很浅，但是通俗易懂，很不错-This my teacher lectures java courseware, the entry very simple, but easily understood and very good! !