chain

大学软件工程数据结构课程设计二叉树实验三种遍历方法(curriculum design,structure data)

链表，输入一定的数据，通过链表进行储存，并排序后输出。(List。Input numbers,then output in order~~)

数值计算方法中高斯主元素消元法 在vc环境中运行 用于解方程组(Numerical methods in the Gaussian elimination method, the main elements of the environment in vc run for the solution of equations)

表达式cpp实现 数据结构实验源代码 实现前序、中序、后序表达式(Expression codes Formerorder expressions regular expression&Postorder expressions )

该代码实现了深拷贝的问题，对于深拷贝进行了一系列的介绍，并且显示其与浅拷贝的区别。(A deep copy of the code issues a series of deep copy for presentation, and shows the difference between a shallow copy.)

这个程序用来解决树结构与树之间的程序匹配的问题这个程序可以解决很多的问题(it is very good)

Monkeys and peach,Monkeys and peach(Monkeys and peach)

说明：  约瑟夫问题，四种解法，分别是静态链表，顺序表两种和循环链表(Joseph problems, the four solution, namely a static list, order form and the cycle of two lists)

本代码主要实现了哈希表的设计，完成了哈希函数的相关要求。(The code is designed to achieve a hash table, the completion of the relevant requirements of the hash function.)

键盘任意输入一组字母或数字生成无序数组，对数组按ASCII顺序进行排序（排序要求至少用两种排序算法），再从键盘输入一个值进行二分查找，返回查找成功或者失败的信息(Keyboard input and a group of letters, or any number of arrays, and generate disordered array sort order according to the ASCII at least two requirements (sort of), sorting algorithms from the keyboard input a value dichotomy, returns to find success or failure of the information)