hill-climbing

最优二叉搜索树问题具有最优子结构性质，即其任意一棵子树都是一棵独立的最优二叉搜索树，所以可以采用动态规划方法，并且在每次更新时保存子树的根。(Optimal binary search tree problem has optimal substructure property that any of its sub-tree are an independent optimal binary search tree, so you can use dynamic programming methods, and save each update subtree roots.)

c-w算法，讲述一种分配运输的节约方法，适合于车辆的调度(c-w algorithm，About one distribution transport saving method, suitable for vehicle scheduling)

有向图的邻接表存储的实现，包括有向图的各种操作(Directed graph adjacency list storage implementation, including a variety of operations to the map)

迷宫求解一般采用“穷举法”，逐一沿顺时针方向查找相邻块（一共四块－东(右)、南(下)，西(左)、北(上)）是否可通，即该相邻块既是通道块，且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(top)进行插入或删除操作的线性表。(Maze solving generally use the " exhaustive" one by one to find adjacent blocks in a clockwise direction (a total of four- East (right), South (down), West (left), North (on)) whether to pass, that the both channel blocks adjacent blocks, and not in the current path. Use a stack to record the path traversed stack is limited only in the tail (top) to insert or delete a linear form.)

本实验设有一个线性表，分别实现数组结构存储的原地逆置。为数据结构课程必做实验。(This experiment has a linear form, respectively, to achieve the storage array structure in situ reverse home. For the data structure courses will do the experiment.)

c++数据结构中的二分查找树，是比较基本的数据查找结构，查找效率比较高(c++ data structure in the binary search tree, is a more basic data to find the structure to find more efficient)

说明：  定义一个类SortArray继承自MyArray，在该类中定义函数sort实现排序功能。 定义一个类ReArray继承自MyArray，在该类中定义函数reverse实现逆转功能。 定义一个类AverArray继承自MyArray，在该类中定义函数Aver实现求解整数的平均值。 定义NewArray类，同时继承了SortArray、ReArray和AverArray，使得NewArray类的对象同时具有排序、逆转和求平均值的功能。在继承的过程中声明为虚基类，体会虚基类在解决二义性问题中的作用。 (Define a class SortArray inherited from MyArray, defined in the class sorting function sort implementation. Define a class ReArray inherited from MyArray, define the function in reverse to achieve such reversal function. Define a class AverArray inherited from MyArray, defined in the class to solve integer function Aver achieve the average. Defined NewArray class, and inherits SortArray, ReArray and AverArray, making the object of both NewArray class sorting, reversing, and the mean value of the function. In the process of succession declared as virtual base classes, virtual base class experience in resolving ambiguities of the role.)

说明：  数据结构基本算法实现。包括栈、二叉树基本运算实现，同时包含整数计算器的完整实现。(The basic algorithm data structure. Including implementation of stack, binary tree basic operations, and a complete implementation of an integer calculator.)

数据结构试验-打印输出计算机本科专业4年每学期的课表；C++实现；图的邻接表存储结构以及拓扑排序的基本思想(Data structure test- printout computer 4 years of undergraduate per semester timetables C++ achieve basic idea of ​ ​ the adjacency table storage structure and topological sorting)

键盘任意输入一组字母或数字生成无序数组，对数组按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)