ＰＯＪ　１１２５己ＡＣ源代码，不信你可以试试．

VC做的矢量画图程序！-VC do vector drawing program!

一个封装好的优先队列,用C++实现的,已经经过调试,直接用就行-A good package priority queue, using C++ Realize, and have been debugging directly on the line

假设银行只有一个窗口（排一个队），客户到达时间间隔服从均值为200秒的指数分布，客户在窗口接受服务 的时间服从均值为300秒的指数分布。设计排队模拟系统，在进行了100人服务后，输出平均到达间隔、平均 等待时间、平均服务时间以及平均停留时间。

高级复制维护注意点- High-level duplication maintenance limelight

一个快速排序算法的实现例子，数据结构课程作业，可作研究学习之用。 包含源文件和详细的开发文档，可方便移植到C等语言平台。-a fast algorithm to achieve example, the data structure course work and can be used for research and study purposes. Includes source document and detailed documentation, will facilitate the transplantation of languages such as C platform.

本系统为餐饮管理系统，为现代餐饮业管理更便捷化，节约时间-This system is catering management system for modern catering industry oriented management more convenient, saving time

数据结构算法实现及解析―配合严蔚敏_吴伟民编著的数据结构（C语言版和C++版）（作者 高一凡）源代码。 本代码含有严蔚敏《数据结构（C语言版）》和《数据结构（C++版）》两本书全书完整源代码，我在Visual C++、Dev C++、Turbo C、Turbo C++、DJGPP、MinGW上调试通过，正在学习数据结构的同学一定要看啊~对学习相当有帮助-Data Structure and Analysis of Algorithms- Wei-Min Yen with吴伟民_ edited by the data structure (C language and C++ version) (The author is one where high) source code. The code contains Yan Wei-Min " data structure (C language version)" and " data structure (C++ version)," book 2 books full source code at my Visual C++, Dev C++, Turbo C, Turbo C++, DJGPP, MinGW debugging through , is studying data structure must depend on the Student ah ~ there is a considerable help to the study

哈夫曼树算法 根据给定的n个权值{w1,w2,……wn}，构造n棵只有根结点的二叉树，令起权值为wj 在森林中选取两棵根结点权值最小的树作左右子树，构造一棵新的二叉树，置新二叉树根结点权值为其左右子树根结点权值之和 在森林中删除这两棵树，同时将新得到的二叉树加入森林中 重复上述两步，直到只含一棵树为止，这棵树即哈夫曼树 -Huffman tree algorithm based on a given n-weights (w1, w2, ... ... wn), construct n trees only a root node of the tree, so that from the right value of wj in the forest root node to select two the right tree for the value of the smallest subtree around, a new binary tree structure, the right to buy a new tree root node value of its subtree root node around the right value in the forest and delete these two trees, At the same time, the new binary tree obtained by adding the forest to repeat the above two steps until a tree containing only the date, that is, Huffman tree tree

越来越多的书会导致非托管库。这里是一个简单的桌面项目，可以帮助任何研究所管理其图书馆。

汉诺塔是初学数据结构的同学最头疼的问题，这里是一个用递归函数解决汉诺塔问题的经典c语言程序，里面有代码和执行文件。-HANOR data structure is that when the students most headaches, here is a solution using a recursive function HANOR a classic c language program, which has code and the implementation document.