lab07

输入N个点的坐标，判断这N个点能否构成一个凸多边形。(Enter the coordinates of N points, to determine whether the N points form a convex polygon.)

数字根算法，用最简单的代码计算数字根。如果把一个大数的各位数字相加得到一个和，再把这个和的各位数字相加又得一个和，再继续作数字和，直到最后的数字和是个位数为止，这最后的数称为最初那个数的“数字根”。(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".)

数据结构课程设计 -电话本（运用了MFC图形化界面）(Curriculum design- the phone book)

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

数据结构与算法分析的 C++检索代码，很经典(the code of Data structure)

对于数据结构每一章节的相应的练习题，巩固好数据结构(To consolidate data structure corresponding practice questions for each chapter of the data structure)

Hanoi塔问题非递归算法实现，几个具体的实现算法(Tower of Hanoi non-recursive algorithm, the realization of a number of specific algorithms)

说明：  链表逆转,实现单链表的逆转程序，数据结构(List Inverse)

数据结构的一些简单的排序算法，有利于初学者学习。(Data structure of some simple sorting algorithm is conducive to beginners learning.)

图的邻接表生成，深度遍历及任意两点间的路径(The adjacency table to generate deep traversal path between any two points)