一个很好的代码传输。

eVC stl 方便大家在evc中使用stl 帮助程序员更方便的编程。-stl facilitate the use of AES stl help programmers more convenient programming.

Netscape浏览器书签转换程序 > 基于浏览器,可进行地址统计,内建搜索引擎 > 强大的自定义功能 > 支持组区分,个人密码设定,类别排序-Netscape browser bookmarks conversion gt; Based on the browser, for address statistics, the built-in search engine gt; Since the definition of the powerful features gt; Support group distinction, personal password creation, ranking categories

添加图形按钮的例子-Add button graphic example

VC经典数据算法代码 几个有意思的算法，初学算法有益，经典，经典-classic VC data algorithm code several interesting algorithm, useful learning algorithm, classic, classic

自己做的核算系统，花费了较长时间，绝对能用，结合数据库操作-Make their own accounting system, spent a long time, absolutely can be used, combined with database operations

基于viusual studio 2005开发的MFC应用程序。是一个建议的虚拟电子琴。是学习的好资料-a mfc application system on viusual studio 2005.it is a virtual piano

这是一个代码为混合灵敏度在鲁棒控制。通过使用此代码，您可以为您的系统找到无穷控制器

array.h： 安全数组 linkedlist.h： 普通表 dclinkedlist： 双向循环链表 hashtable.h： 哈希表 binstree.h： 二叉搜索树 avltree.h： AVL 树 如果要存储集合（元素不可重复）并快速查找，最佳的是 binstree.h（二叉搜索树）。 如果要存储二维或更高维的表格，最佳的是 hashtable.h（哈系表）。AVL 树的插入成本非常高（删除函数也没有实现），但 AVL 的搜索效率极高，所以适用于在程序开始前初始化程-NOTE: array.h :secure array,linkedlist.h:common table, dclinkedlist:dual cycle linkedlist, hashtable.h:hash table binstree.h:binary search tree, avltree.h: AVL tree, if you want to store set(elements no repeating) and to lookup it swiftly,best is binstree.h(binary search tree).if you want to store two dimensions s or more dimensions s table,best hashtable.h(hash table).the cost of AVL tree s insertion is very high(delete function is not completed),but effiency of AVL tree s search is very high,so it is the same with initialize programme before beginning programme.

poj典型题目解题思路详解 包含源代码和解题时应注意的问题及题目陷阱设计分析-POJ typical Oklahoma Elaborates on topics include source code and they should pay attention to solving the problems and pitfalls topic Design Analysis

编译原理程序，有些错-compiler principles procedures, some mistakes