WinMain 函数的初级代码

快速排序算法代码Quick sort algorithm code-Quick sort algorithm code

还可以啦!!有问题请讲-can! ! There are problems, please

动态连接ODBC数据库.使用通过数据源的名称动态链接访问ODBC数据库，如果程序中使用的数据库程序运行时是不确定的，数据库表中的域和记录可能被改变，那么通过指向数据库的数据源动态的对该数据库进行操作是比较好的方法．-Dynamic Link ODBC database. Data sources through the use of the name of Dynamic Link visit ODBC databases, If the procedure is used in the database program running is uncertain, database table fields and the record is likely to be altered, So, through the database at the data source dynamic database operation that is a better one.

有很陡数据结构的flash,PPT,帮你快速理解算法,一步步执行理解方便-There are steep data structure, flash PPT, to help you quickly understand the algorithm, a step by step to facilitate the implementation of the understanding

VB的图书馆系统，数据库使用ACCE-VB of the library system, the use of ACCESS database

求矩阵特征值、解方程组 -seeking matrix eigenvalue solution equations for matrix eigenvalue equations Solutions

HUFFMAN树的构造算法，求最佳二元码并能借助二元码进行编码和解码。-Huffman Tree Construction Algorithm, and the best use of binary code and binary code encoding and decoding.

Matlab 实现的 "WinPR" 文件的基础：获取更多地从图像分割评价。页 362-366 D.NAACL 打 2012 年 Scaiano M.，Inkpen原始脚本 http://scaiano.com/martin/SegEval.htmlMatlab 的适应： Juan G.法国

实现树的创建算法，创建一个至少包含3层，8个结点的二叉树，并对此树实现先中后序的递归遍历算法。输出三种遍历结果。再实现一个叶子结点查找算法，判断一个给定的数值是否在此树中作为叶子结点。-To achieve the creation of the tree algorithm, to create at least a three-layer, 8 nodes of a binary tree, and after this tree in order to achieve the first recursive traversal algorithm. Output the results of three kinds of traversal. And then to achieve a leaf node search algorithm to determine whether a given value in this tree as a leaf node.

ｃ＃语言快速入门基础代码带注释，主要是针对那些对C#想快速入门的人并且有一定的C++基础的人提供的，快如懂得C#的基本语句和面向对象的基本思想。