我不是编程高手，现在刚开始从事编码工作。所以还有很多东西要学习。我上传的代码是我学习并验证过的正确代码，不是垃圾，随着学习的深入，我会不断提高上传代码的质量。谢...

一个关于串的基本操作的事例程序-a series on the basic operation procedures stories

这是一个运算符重载的实例程序，程序中以复数的加法作为例子，实现将加法运算符重载，得到c=c1+c2直接得到俩个复数相加的和-This is an example of operator overloading, programs, the addition in the plural as an example, to achieve an additive operator overloading, to be c = c1+ c2 directly from the sum of both a complex and

本数据库为access2000格式，如使用的是access97必须用access2000对数据库进行转化 后方可修改。-access2000 the database format, such as the use of Access must access2000 the database after conversion may be revised.

宾馆客房管理系统-Hotels Rooms Management System

用C++写的坦克大战，是一个VS2010的工程，已经生成exe，包含全部源代码和资源文件，地图可以通过鼠标来编辑和保存，可以选关，有人性化的、明确的指示，方便游戏，共同学习。

MammoothLibrary是一个C++类的收集器，主要是为那些没有时间研究和执行自己代码的程序员提供一个多线程便携式环境。其核心建立在SCOOP原型基础上。-MammoothLibrary category C is a collection device that is mainly for those who do not have time to study and implement its own code programmers to provide a portable multi-threaded environment. Its core SCOOP prototype built on the foundation.

Windows Mobile 中如何制作Setup D-Windows Mobile How to make Setup DLL

K r u s k a l算法每次选择n- 1条边，所使用的贪婪准则是：从剩下的 边中选择一条不会产生环路的具有最小耗费的边加入已选择的边的集合中。注意到所选 取的边若产生环路则不可能形成一棵生成树。K r u s k a l算法分e 步，其中e 是网络中 边的数目。按耗费递增的顺序来考虑这e 条边，每次考虑一条边。当考虑某条边时，若将其 加入到已选边的集合中会出现环路，则将其抛弃，否则，将它选入。-K ruskal algorithm for each choice of n-1 edges, the greed of the criteria used are: from the left edge select does not produce a loop with the smallest cost edge has been selected to join the edge of the collection. Taking note of the selected edges have a loop if it can not form a spanning tree. K ruskal algorithm sub-e-step, in which e is the number of network edge. According to the order of incremental cost to consider this e edges, each taking a side. When considering a certain edge when, if its added to a collection of selected edge loop will appear, will be its discarded, otherwise, it selected.

包括基本的Verilog CPU接口程序和激励程序。

Win32中的两种线程--GUI线程与工作线程-two of the Win32 threads-- GUI thread with thread