实现内存分配的一个clock的改进算法

用C++实现的队列数据结构。对数据结构和算法的初学者是很好的学习材料。-The file is about queue data structur.It is implemented with C++ language.

ssd4exercise5的作业答案，欢迎你的下载，谢谢了-Operating ssd4exercise5 the answer, you are welcome to download, I would like to thank the

计算机图形学点在多边形内/外的判断，给出了一个例子，可以画任意的多边形，判断点是否在多边形内，可直接运行。-Computer graphics point in polygon inside/outside of the judge is given an example, you can draw an arbitrary polygon, point to determine whether the polygon can be directly run.

跟着鼠标转的眼睛-with eyes turned to the mouse

实现了比如一个字符数组14232156的整形数组。经过此算法后转换成12345612的排列顺序。此代码对棋牌类游戏中的出对子有帮组-Realize the array of characters such as a plastic array 14232156. After this algorithm into a sequence of 12345612. This code of Card games in the pair has helped the group

扑克牌游戏，基于VC++6.0 益用来学习交流之用-Poker game, based on VC++6.0 is used to study the exchange of beneficial use

GIF (including animated GIF87a and GIF89a), JPEG, BMP, WMF, ICO, CUR

Aes加密算法，用C++实现，封装成了类，方便学习与扩展

用 c 写的一个包含代码段文件作为输入和输出写入到另一个文件的代码段的词法分析器 ︰ output.txt

Delaunay三角网作为一种主要的DTM表尔法，具有权其广泛的用途。经过二十多年来的研究，它的生成算法巳趋于成熟。本文简要介绍了Delaunay三角网的定又及其特性，在简单回顾和评价了分割―归并法，逐点插入法，三角冈生长法等三类主沈算法的基础上，提出了一个融以上算法优点于一体，兼顾空间与时间性能的合成算法。经测试，一般情况下它的运算速度远快于逐点插入法，与分割―归并法相当，较好的情况下快于分割―归并法。-Delaunay Triangulation as a major DTM Fall table, with the right to its extensive use. After 20 years of study, which had been generating algorithm is maturing. This paper introduces a Delaunay Triangulation and another set of characteristics, in a brief review and evaluation of the divide-conquer method, point by point insertion method, the supraspinatus Growth Triangle law Shen three main algorithm on the basis of the above algorithm into an advantage in that balanced space and time performance of synthesis algorithm. After tests, under normal circumstances it"s computational speed much faster than the insertion point by point, and the divide-conquer method rather, a better situation faster than divide-conquer method.