Phone-book

二叉排序树，可以实现插入，删除，查找，创建功能(Binary sort tree,you can achieve the insert,delete,search,create functional)

用分治算法（O(nlogn)复杂度）实现寻找n个点中最邻近点对,输出为最邻近距离的平方(Looking for n points nearest point, the output of the nearest neighbor distance squared using the divide-and-conquer algorithm (O (nlogn) complexity))

参加数学建模的同学很可能会遇到这套题。本程序采用链表进行编写，很方便地解决了小白鼠问题。(Mathematical modeling of the students participating are likely to encounter this question, the program uses the list to solve the problem of mice, very convenient.)

直接插入排序算法验证。 快速排序算法验证。 直接选择排序算法验证。 (Direct insertion sort algorithm validation. Quick sort algorithm validation. Direct selection sort algorithm validation.)

用于迷宫问题的解决用户根据根据要求进行设置即可在屏幕上显示(Maze problems for users in accordance with the requirements set can be displayed on the screen)

希尔排序(Shell Sort)是插入排序的一种。是针对直接插入排序算法的改进(双语对照查看希尔排序(Shell Sort)是插入排序的一种。是针对直接插入排序算法的改进。 Hill sorting (Shell Sort) is a kind of insertion sort. Is to improve the direct insertion sort algorithm. )

魔王语言：输入一串字符，可自动翻译成一串语言。(the program of language)

从屏幕输入字符 判断括号匹配问题 数据结构作业(Judgment parenthesis matching data structure operations input characters from the screen)

邻接表存储图，然后进行深度优先遍历及广度优先遍历。(DFS,adjacent matrix)

图中计算最短路径，必须覆盖所有的节点，效率很高(to compute the shortest path in the graph)