LinkQueue

求解TSP问题的蚁群算法图形演示程序,并有相应的比例统计界面,重新编译程序后,再运行()

aco code code aco to problem ant colony

动态实现堆栈和队列的添加、删除等的操作，C代码实现(Dynamic realization of the stack and queue add, delete and other operations)

冒泡优化： 如果一个序列是int n[]={1,2,3,4,5,6,7,8,9} , 用正常的冒泡排序需要排8次才行，优化之后1次就好，也就是说序列越接近于正常序列，改进之后的冒泡排序的次数就越少，这样会给一个冒泡排序算法带了很大的效率。 思想：添加一个boolean变量用来判断冒泡是否是已经排好了顺序，如果boolean的值为false，说明是已经排好了，如果boolean的值true，说明没有排好，继续排。(If a sequence is int n [] = {, 1,2,3,4,5,6,7,8,9} need to row 8 times the job after optimization times like normal bubble sort, but alsomeans that the sequence is more close to the normal sequence, improved bubble sort, the less the number, which would give a bubble sort algorithm with a great deal of efficiency. Idea: add a boolean variable used to determine the bubble whether it is already lined up the order, if the boolean is false, indicating already lined up, if the boolean value of true, did not line up, continue to row.)

经典算法巴斯卡三角的简单实现，vs2010编译通过(Simple implementation of the classic algorithm Pascal triangle, vs2010 compiled by)

数据结构的习题和解答，特别希望我能上传上去啊(data structure of the questions and answers, and I especially hope that I can upload up ah )

数据结构与算法强化训练，近百页，课程学习的基本资料(Basic information of the data structures and algorithms, nearly a hundred pages of the intensive training course)

数据结构 课件 附PPT　附实现源码数据结构 课件 附PPT　附实现源码(Class data structure attached PPT courseware data structure to achieve source components attached attached attached PPT achieve source)

说明：  在二叉查找树类中增加一个成员函数，检查当前的二叉查找树上的每个结点是否都满足二叉查找树的有序性(Add a member function to the binary search tree class to check whether each node on the current binary search tree satisfies the order of the binary search tree)

good stacks and queues example