界面美观,功能齐全,连接数据库,适合初学者

这个项目主要集中在数据库连接。连接数据库系统中是至关重要的因素。它是决定功能和应用程序的效率的一个因素。它是只反映在前端所做的更改将反映在后端，反之亦然。在这里，前端是 Visual basic 6.0 和后端是 Microsoft Access。它是容易和友好学习的学习者和还在代码中的任何修改可以做很容易。

Its about the data structure Q-Its about the data structure Queue...

求解约瑟夫问题。设有n个人围成一个圆圈坐下，对所有围从的人从某个位置开始编号为1,2,3，……，n,从编号为1的人开始报数1，报数依交进行，报数n的人即出列，下一个人从1开始报数，再报数m的人便是第二个出列的人如此重复下去，直到最后一个人出列为止，于是便得到一个出列的顺序，这称之为约瑟夫(Josephu)问题。-solving problems. N individuals have formed a circle to sit down, all right Wai from the start from a position of No. 1, 2, 3, ..., n, for a number of people reported a few, according to several newspaper pay, the newspaper n ie the out, the next person was from the beginning a few , and reported m is the second out of this series continue to repeat until the final out in a series, then get a series out of order, which called Joseph (Josephu) problem.

从fortran编译器生成的exe文件连接ORACLE DB的示例代码。本程序通过oracleserver8.05和9i测试，使用了一些表中的数据。需要Oracle TNS名称文件进行连接。

数据结构 详细描述了如何链栈的方法以及操作-Data structure described in detail how the chain stack method and the operation of

K路归并算法 * 本程序用来实现K路归并算法 * 在Turbo C2.0编译器下编译通过 * 算法过程中 * K由用户输入 * 用户选择需要归并的数据的个数 * 由程序生成随机数据，数据结构为链表，并展示给用户 * 然后程序告诉用户需要增加的虚节点的个数 * 并把虚节点加入到链表中去，最后进行归并 -K Road merge algorithm* This procedure used to realize the way merging algorithm for K* in Turbo C2.0 compiler compiler under the process through the* algorithm* K* by the user input the user select the number of merging the data* generated by the random data , data structure for the list, and display to the user* and then the procedure to tell the user the need to increase the number of virtual nodes and virtual nodes* added to the list going, and finally to merge

VC进行数据库编程，MFC编写的，可以与CListCtrl控件配合使用-VC database programming, MFC prepared can be used in conjunction with the CListCtrl control

ado-xmlcaozuo

离散点插值程序，采用的是cressman客观插值原理-discrete points interpolation procedure, the objective is cressman interpolation Principle

最短路径问题C++描述-Shortest Path Problem Description C