详细讲解了Mean

设置窗体置顶源码-Set Top source form

十字绣游戏，根据周围的数字说明，点击鼠标左键选中，右键撤销-cross image

数独是一种源自18世纪末瑞士的数学智力拼图游戏。拼图是九宫格（即3格宽×3格高）的正方形状，每一格又细分为一个九宫格。在每一个小九宫格中，分别填上1至9的数字，让整个大九宫格每一列、每一行的数字都不重复。 数独的玩法逻辑简单，数字排列方式千变万化。不少教育者认为数独是锻炼脑筋的好方法。-Sudoku is a kind of Switzerland originated in late 18th century mathematical intelligence jigsaw puzzle. Puzzle is the squares (ie, 3 cells wide × 3 grid H) of square-shaped, each divided into a fine grid squares. Small squares in each of the respective fill in the figures 1-9, so that the whole big squares in each row, each row will not repeat the figures. The logic of playing Sudoku is simple, the arrangement of the ever-changing figures. Many educators think Sudoku is a good way to exercise their brains.

数据库复习题 数据库复习题，希望大家能用到。-Database database Exercises Exercises, I hope that everyone can use.

本程序示例如何将多个文件合并成一个文件，并能够自分解。此技术在制作安装程序时非常有用。我在本网站学到了此技术，并将他整理扩展，能够合并文件和目录，个数不限。-example of the procedures on how to merge multiple files into a document and to be able to decomposition. This technology in the manufacture and installation procedures will be very useful. On this website I learned this technology, he will collate extended to merge files and directories, open-number.

类似小画家功能可以用来显示并编辑图档。-Drawing a similar function can be used to display and edit files.

dos学习程序 学习dos必备哦 希望对大家有用-dos learning process is essential to learn dos Oh, you want to be useful

粒子群算法工具包，包括动态环境的寻优，还可以直观看到粒子的搜索过程-Particle swarm optimization tool kit, including the dynamic environment of the optimization, you can also see the particles in an intuitive search process

labview程序语言中FOR,IF等基本功能的使用例子-LabVIEW programming language in the FOR, IF, such as the use of examples of the basic functions

1 编写采用二叉链表形式存储的二叉树的创建、先序、中序、后序和按层遍历的算法。 2 编写将一棵二叉树的所有左右子树进行交换的算法。 提示：验证是否交换可以调用二叉树的遍历算法，比较输出结点序列。 3 编写一个主函数，将上面函数连在一起，构成一个完整的程序。 4 调试并运行实验源程序。 -Prepared using a binary list stored in binary form of the creation, the first sequence, the sequence, after the order and by level traversal algorithms. 2 the preparation of a binary tree will be all about the exchange of sub-tree algorithms. Tip: Verify that the exchange can be called binary tree traversal algorithm to compare the output node sequence. 3 write a main function, the above functions together to form a complete program. 4 debug and run experiments source.