Lecture7

说明：  约瑟夫算法，适合初步学习数据结构的同学了解递归调用的特点(josephus in C language)

一本介绍各种算法的经典书籍，计算机算法设计与分析(A classic book introduces a variety of algorithms, algorithm design and analysis of computer)

该程序分析eit表的数据结构，病输出相应内容信息(parse eit table and output content info)

简单的汉诺塔算法，采用归约算法的思想，实例是三个盘子，三个柱子(Simple HANOR algorithm)

学数据结构自己总结的东西，希望对大家有所帮助。(Learn data structure sum things up, we want to help.)

北邮数据结构课程设计大作业之旅行模拟查询系统。可实现多线程多旅客、中途更改计划、动态显示旅客状态等多个需求。已通过验收。(BUPT curriculum design travel query system simulation of large operations. Multithreading enables passengers to change plans midway, dynamic display multiple demands guest status. It has passed inspection.)

数据结构课程设计时，所需的封面及任务书版面，希望对大家有点用！(Curriculum design data structure, the necessary task of the book cover and layout, in the hope that we are a bit used!)

用c语言写的线性链表的创建、删除、插入、销毁代码(With c language to create a linear linked list, delete, insert, destroy code)

多段图、遍历、排序。用C语言解决多段图中的成本问题，得出最佳优化方案。(More paragraphs figure, traverse, ranking. C language solve more paragraphs in the chart the cost, obtains the best optimization scheme. )

数字根算法，用最简单的代码计算数字根。如果把一个大数的各位数字相加得到一个和，再把这个和的各位数字相加又得一个和，再继续作数字和，直到最后的数字和是个位数为止，这最后的数称为最初那个数的“数字根”。(Digital root algorithm, with the most simple code to calculate the digital root. If you figure in a large numbers is the sum of a, then this and you figure the sum is again a, and then continue for digital and until the final figure and the single digits, the last number called initially that the number of "digital root".)