vfp表单，锁住和解锁数据表。（压缩文件）

Program in FoxPro that creates a database and a management interface to the database. Similary to a store database.

等值线追踪与绘制(源代码)(1.0).rar-contour mapping and tracking (source code) (1.0). Rar

说明: 这一段在复习数据结构和算法，有一些零星笔记，在Others这个归类下，欢迎指正。 对于排序算法，想做一个动态演示的东东，因此今天使用VB.net大概实现了一个，界面如下，代码有2个版本，一个可以指示当前循环的位置（但设计感觉不好，也找不到更好的办法），一个没有。 -Note : This section of the review of data structure and algorithm, a few scattered notes, in the classified Others, welcomed the correction. For Sorting Algorithm and do a demonstration of the dynamic page, and it is probably using VB.net achieved one of the following interface, the code has two versions, one can instruct the current cycle position (but feel bad design, but also find better ways), a no.

数据结构大作业的非界面版-large data structure of the non-operational interface version

数据结构，牛顿插值法。通过牛顿插值法求解方程-Data structure, Newton interpolation. Solving equations using the Newton interpolation

二叉树系数计算[DeV-C++学习]，利用动态规划动态编程计算

全国计算机等级考试三级的部分上级题算法，对上机考试还不是很熟的人，很有帮助（并非书上的答案，是本人自己想的算法）-National Computer Rank Examination some three superiors that the algorithm, right on the test machine is not very familiar with the helpful (and not the answer book, I want to own the algorithm)

java程序实现的通俗易懂的二分查找的算法源代码-java program to achieve the user-friendly dichotomous search algorithm source code

用prim算法实验最小生成树 本程序中用到函数adjg( )，此函数作用是通过接受输入的点数和边数，建立无向图。函数prg( )用于计算并输出无向图的邻接矩阵。函数prim( )则用PRIM算法来寻找无向图的最小生成树 定义了两个数组lowcost[max],closest[max]，若顶点k加入U中，则令lowcost[k]=0。 定义二维数组g[ ][ ]来建立无向图的邻接矩阵。 -Prim algorithm using minimum spanning tree of the experimental procedures used in function adjg (), this function is through the acceptance of input points and edges, the establishment of a directed graph. Function of prg () used to calculate and output undirected graph of adjacency matrix. Function prim () is used PRIM Algorithm to find the undirected graph of the minimum spanning tree array defines two lowcost [max], closest [max], if it joined the U of k vertices, then the lowcost [k] = 0. The definition of two-dimensional array g [] [] to create a undirected graph of adjacency matrix.

一款很使用的数据库代码-one is the use of the database code