DouglasPeucker

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

大学计算机专业，数据结构中的改进的KMP算法，C++编写。(University computer science, data structures to improve the KMP algorithm, C++ written.)

有助于c++的初学者在平日的学习中更好的学习(Contribute to better learning c++ beginners learning on weekdays)

数据结构课设，城市地铁站的设计与使用规划(Set data structure class, subway station design and use of planning)

说明：  还是通讯录系统 增删改查 课程设计 本科学校要求的数据结构课程设计(Or address book CRUD the data structures required by the curriculum design undergraduate schools curriculum design)

一个关于约瑟夫环问题的经典算法编程的C语言实现(the program about JOSEPHUS)

哈希表 数据结构课程设计 1.1问题描述 针对自己的班集体中的“人名”设计一个哈希表，使得平均查找长度不超过R，完成相应的建表和查表程序。 1.2基本要求 假设人名为中国姓名的汉语拼音形式。待填入哈希表的人名共有30个，取平均查找长度的上限为2。构造哈希函数，用链表法处理冲突。 1.3测试数据 读取熟悉的30个人的姓名作测试。(Hash table Data Structure Course Design 1.1 Description of the problem For their own class group of the "names" to design a hash table, making the average search length does not exceed R, the completion of construction of tables and look-up table corresponding procedures. 1.2 Basic requirements Assuming the name of the person called Chinese pinyin form. To be filled into a hash table names a total of 30, taking the average search length of the upper limit of 2. Construct a hash function, treatment with a list of conflict. 1.3 Test Data Read the familiar names of 30 individuals tested.)

二叉树的中序遍历，先序遍历以及后序遍历的算法(Binary tree in preorder traversal, preorder traversal and postorder traversal algorithm)

链表的建立及相关处理，包括排序，删除，初始化，增加，删除等等，且程序已运行通过。(The establishment of a linked list and related processing, including sorting, delete, initialization, increase, delete, etc., and the program has been run through )

就是一个简单的约瑟夫环实现程序。主要就是在痛过程序实现栈的实现。(Joseph is a simple procedure to achieve ring. The main program is in pain over the realization of the realization of the stack.)