mofanwenti

实现约瑟夫问题的4种算法，并有计时功能进行效率测试(4 algorithms to resolve Josephus Problem with timing counter for testing efficiency)

插入排序与合并排序的算法比较，比较两种算法的优劣(Comparison of insertion sort and merge)

最小生成树算法 克鲁斯法尔算法 球最佳路径(kulru method class maiun void cx )

说明：  用链表的方式实现多项式的加减，其中结构体包含幂次和系数。(Polynomial addition and subtraction with a list of ways in which the structure and contains the power of coefficients.)

B-树的创建、插入、删除等一系列操作！(B-tree creation, insert, delete a series of manipulations!)

用c/c++写的二叉排序树的插入与删除，有兴趣的朋友可以看一下(Insertions and deletions using c/c++ to write binary sort tree)

数据结构的稀疏矩阵的几部分操作，广工的课程设计(Sparse matrix operations)

PRIM算法 对任意给定的网和起点，用PRIM算法的基本思想求解出所有的最小生成树。(PRIM algorithm for any given network and the starting point, PRIM algorithm used to solve the basic idea of all the minimum spanning tree.)

C语言树的简单实现,介绍了树你前序遍历，树插入与删除节点的实现(C-tree is simple to achieve, before you introduced the tree traversal, tree insert and delete nodes to achieve)

C语言插入排序算法及代码 C语言中函数参数的传递有：值传递、地址传递、引用传递这三种形式。题一为值传递，题二为地址传递，题三为引用传递。(Insertion sort algorithm and C language code The parameter of function in C language transfer: transfer value, address, pass by reference to these three forms. Problem a value transfer, the transfer of Title address, three for reference. )