basika

实现超市中排队购物用时最短，是计算机算法设计与分析中的一道题。自己写的程序，原创！(Achieve queued supermarket shopping with the shortest, is a question in the design and analysis of computer algorithms. Write their own procedures, original!)

一个KDtree的程序，包含建树过程和消耗的时间。(A KDtree procedures, including the contribution to the process and time consuming.)

说明：  数据结构课上作业实现了一个多项式乘法的功能有注解(Job class data structure implements a polynomial function of multiplication comments)

提供字符串方法，大家面试可以用，包括找出对称字串(Some string function)

各种排序的模板实现，并分析了各种实现的时间复杂度及改进办法(Templates of various sort, and analyze the time complexity of the various implementations and ways to improve)

拓扑排序 -打印输出计算机本科专业4年每学期的课表(Topological sort - computer printout of undergraduate curriculum of each semester for 4 years)

POJ 字符串的插入 可以将一定长度的字符串插入之前给出的字符串之中(POJ string can be inserted into a length of string into a string before being given)

数据结构循环队列的实现 在visual c++6.0运行(Circular queue data structure to achieve the visual c++6.0 run)

说明：  用从c＋＋写的floyd最短路径算法，可以求邻接矩阵任意两点的最短路径。(from using c++ to write the Floyd shortest path algorithm, can help adjacency matrix arbitrary 2:00 Shortest Path.)

关于中国邮递员的解决办法，个人觉得还不错的说(Chinese postman)