实现硬币点，一点，两点，五个硬币。封闭版本…

库存管理系统将自动存储库存明细信息，并在需要时对库存明细信息进行维护和更新

一个有用的数据库操作程序（用jubilder）-a useful database operations (using jubilder)

酒店管理系统是一个理想的软件解决方案，酒店行业，可用于宾馆，旅馆，酒店，度假村，旅馆，招待所，军事

最小生成树算法 克鲁斯法尔算法 球最佳路径-kulru method class maiun void cx

这是一个用PB和SQL SERVER做的课程设计,模拟完成了,银行的开户,销户,存款,取款等功能.-with PB and SQL SERVER do curriculum design, simulation completed, the bank accounts, and marketing of households, deposits, withdrawals and other functions.

2元树的先根遍历算法，中根遍历算法，后根遍历算法-2 yuan tree traversal algorithm first root, root traversal algorithm, after the root traversal algorithm

求解网络中的最短路径。假设某个计算机网络有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.

用栈的形式实现车厢调度,火车入口处的车厢序列编号为1到n-Realizes the compartment dispatch with the stack form,The train entrance compartment sequence serial number is 1 to n

单链表倒序 ，多个栈公用一块存储空间，以及迷宫问题的求解 -Single linked list in reverse order, more than a stack of public storage space, as well as solving a maze problem

这是用QB编的排序程序。利用条形显示冒泡排序、快速排序、等五种排序方法。 效果一流，对于C语言，数据结构爱好者是不错的选择。-This is the sort made by QB procedures. Strip shows that the use of Bubble Sort, Quick Sort, five sorting method. The effect of first-class, for C language, data structure enthusiasts is a good choice.