001

数据结构经典算法 约瑟夫问题 c++ 已经测试通过(josephus c++)

PKU ONLINEJUDGE 2371

实现冒泡，快速，希尔排序法。并计算，比较他的次数。(Achieve bubbling fast shell sort. And calculate, compare the number of times.)

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.)

用控制台实现了经典的数据结构B树，可以通过测试文件.txt加载已有的B树，有插入，删除，查找的功能，加深对数据结构的理解。(Using the console to achieve the classic B tree data structure, you can pass the test document. Txt already loaded B-tree, there are insert, delete, search functions, to deepen understanding of the data structure.)

本算法用于实现二叉树的查找和输出，使用了数据结构中的二叉树结构，精髓在于使用了函数指针。( This algorithm is used to find and implement binary output, use the data structure of the binary tree structure, the essence is the use of function pointers.)

快速排序，用数组的存储结构，实现数的排序。共有八组随机数据，还能够计算出每组数据的处理时间，最终得到平均时间。(Quicksort array storage structure, to achieve the sort of number. A total of eight sets of random data, but also be able to calculate the processing time of each data, and eventually obtain the average time.)

字符串，实现了文件中查找想要的字符串，并将其标记出来

一个经典的旅行商问题源码，不是最优解，只是一种 思路(A classic traveling salesman problem source is not the optimal solution, just a thought)

约瑟夫问题，用数据结构的循环链表实现约瑟夫问题的解答(Joseph problems，30 people in a circle, and inspires us with a circular chain to said. Can use structure array to make a cycle chain. The structure has two members, one for pointing down a pointer to a circular chain )