report!

北大OJ 1417题的标程代码，并查集和深度优先搜索的经典实现-OJ 1417 North title scalar-way code and search sets and the classic depth-first search to achieve

很少有labwindows/CVI方面的数据库的例子，现在给大家提供一个，谢谢管理员将我开通下载功能wu.jg@163.com-few labwindows/CVI the database example, Now give us a, I would like to thank my manager would open the download function wu.jg @ 163.com

快速傅立叶变换FFT的动态链接库DLL，适合个种语言，VB，VC，delphi-FFT fast Fourier transform of the DLL, suitable species language, VB, VC, Delphi, etc.

根据储蓄管理条例，计算储蓄定期利息的程序。-savings under the regulations, the periodic interest savings calculation procedures.

二叉树的建立与遍历 可实现： （1）树的创建采用先序方式，用特殊符号0表示左、右子树为空 （2）每次输入一个节点的值，可以根据自己的需要设计不同的节点结构 （3）节点的值为非零数 （4）可以（）形式输出创建的树 （5）用先序后序和中序遍历树 （6）销毁树 -Establishment and tree traversal can be achieved: (1) tree created using the first order approach, with special symbols 0 express the left and right subtree is empty (2) for each input the value of a node, you can according to their own needs Design of different node structure (3) non-zero value of the node number (4) can () to create the form of the output tree (5) after the first sequence and the sequence of traversal tree (6) the destruction of trees

集装箱的装箱问题 给定一个集装箱，其长为L，宽为W和高为H，现有一批圆柱形木材，每根木材的长均为L，但是半径不同，设第i根木材半径为ri。问如何装箱，使得集装箱的空间利用率最高？-problem given a container, its length L, width W and H for high, existing batch of cylindrical wood and each timber are long L, but different radius, based i-radius of the wood-ri. Asked how crates, containers make maximum utilization of space?

c语言用堆栈实现表达式计算，数据结构练习题。

排序是数据结构中的一项重要内容，该算法包括了直接插入冒泡选择排序算法的实现- The arrangement is in a construction of data important content, this algorithm has included the direct insertion bubbling choice sort algorithm realization

面试经常遇到的大数相乘问题，代码简洁易懂-Interviews are often encountered in large numbers multiply problems, the code easier to understand

轻量级数据库软件,嵌入式设计可以考虑考虑,性能不错-Lightweight database software, embedded design can take this into account, the performance of good