在线考试系统

用Delphi开发的经典的数据库系统-with the classic Delphi database system

数据结构。拉格朗日插值法算法。通过拉格朗日算法求方程-Data structure. Lagrange interpolation algorithm. Through the Lagrange method of Equation

够你们交作业了-enough perpendicular operation of the Ha Ha

各种常用的排序算法源程序,包括快速排序/归并排序/带限期的排序以及贪心法的实现程序-various commonly used algorithm source, including rapid sequencing/merge sorting/ranking with the deadline and the greedy method to achieve procedures

数据结构二叉树的源码-binary tree data structure FOSS

求解网络中的最短路径。假设某个计算机网络有n个站点，依次编号为1,2,…,n；有的站点之间有直接的线路连接（即这两个站点之间没有其它站点），有的站点之间没有直接的线路连接。如果用三元组（i,j,f）来表示该网络中的站点I和站点j之间有直接的线路连接且它们之间的距离为f 当已知该网络各站点之间的直接连接情况由m个三元组（i1,j1,f1）,(i2,j2,f2),…,(im,jm,fm)确定时，要求计算出对于网络中任意一个站点g(1≤g≤n)到其余各站点的最短距离。-the shortest path. Assuming a computer network n site, followed by No. 1, 2, ..., n; Some sites have direct connections (that is, between two sites are no other site), and some sites have no direct connections. If three yuan (i, j, f) to the network said the site j site and I have direct connections between them but the distance of f the network known as the site of the direct link between the situation by 3 m (i1, j1, f1), ( i2, j2, f2), ..., (im, jm, fm) to determine, calculate requirements for a network site arbitrary g (1 g n) of the rest of the site is the shortest distance.

一个有关于VC++6.0与ACCESS数据库的小程序-1 on VC++6.0 and the ACCESS database, a small program

磁盘文件最优存储问题，设磁盘上有n 个文件f1, f1,fn，每个文件占磁盘上1 个磁道。这n 个文件的检索概率分别是p1, p2, , pn-document optimal disk storage, disk based on documents n f1, f1, fn. each file on disk for a cylinder. N This document retrieval probability were p1, p2, and pn

扩充了C++ Builder DBGRID 控件的功能，实现隔行变换颜色等功能-Expansion of the C++ Builder DBGRID control functions, the realization of interlaced color transform functions

一个小型的排序算法，使用了泛型算法等知识，对初学泛型有帮助-A small sorting algorithm, the use of a generic algorithm knowledge of generic beginner help