errormodeling

各种排序的模板实现，并分析了各种实现的时间复杂度及改进办法(Templates of various sort, and analyze the time complexity of the various implementations and ways to improve)

利用极小极大算法实现简单的零和博弈；利用递归算法实现博弈树搜索的方法，并解决牛角棋问题。(Using minimal algorithm to achieve a simple zero-sum game the use of recursive algorithm to achieve the game tree search method, and solve the horns chess problem.)

说明：  二叉树的演示程序。实现了二叉树和哈弗曼树(Binary tree demo program. Implements a binary tree and the tree Hafu Man)

这是一个堆排序的算法源程序，算法被单独写成一个函数，希望对大家有用(This is a heap sort algorithm source code, algorithms are written as a separate function, we hope to be useful)

说明：  顺序表的基本操作：1. 编写函数，输入一组整型元素序列，建立一个顺序表。 2. 编写函数，实现对该顺序表的遍历。 3. 编写函数，在顺序表中进行顺序查找某一元素，查找成功则返回其存储位置i，否则返回错误信息。 4. 编写函数，实现在顺序表的第i个位置上插入一个元素x的算法。 5. 编写函数，实现删除顺序表中第i个元素的算法。 6. 编写利用有序表插入算法建立一个有序表的函数。 7. 编写函数，利用以上算法，建立两个非递减有序表，并把它们合并成一个非递减有序表。 8. 编写函数，实现输入一个元素x，把它插入到有序表中，使顺序表依然有序。 9. 编写一个主函数，在主函数中设计一个简单的菜单，分别调试上述算法。 (The basic operation of the order form)

数据结构算法集锦：包括大量常用算法，如求两数的最大公约数、素数的求法、Prim算法、Kruskal算法、最短路径、Dijkstra 算法、排序相关算法、高精度计算相关算法(algorithm data structure highlights include : large common algorithms, such as for the number two majors, for the prime numbers, Prim algorithm, Kruskal algorithm, the shortest path, the Dijkstra algorithm, scheduling algorithms, high-precision calculation algorithms, etc.)

C++实现的两类问题随机森林生成算法，对学习随机森林很有帮助(Source code for random forests,wanderful codes,and help youself to it!)

说明：  今天，小 G 已了解到修理厂共有 m 种不同的修理原料，对于第 i 种原料，可以对任意一个石桥的美化度增加 di，当然这也需要花费 hi 的费用。由于发货场的修理原料有限，对于任意一种修理原料，只有一件，也就是说小 G 只能选择购买和不购买，对于第 i 种修理材料能成功修理第 j 个石桥的条件是：当且仅当 hi ≥ pj，di ≥ vj。现在，已知这 n 个石桥修理的最小花费值，最小美化需求度，以及 m 种修理原料的费用，可对石桥增加的美化度值，请你帮助小 G 完成这个修理任务。(Today, Xiao G has learned that there are m different repair materials in the repair shop. For the first material, Di can be added to the beautification of any stone bridge. Of course, it also costs hi. Because of the limited repair materials in the delivery yard, there is only one repair material for any kind of repair material, that is to say, small G can only choose to buy or not to buy. For the first repair material, the condition for successful repair of the jth stone bridge is: if and only if hi is greater than pj, Di is greater than vj. Now, the minimum cost of repairing n stone bridges, the minimum demand for beautification, and the cost of m kinds of repairing materials are known, which can increase the beautification value of stone bridges. Please help Xiao G to complete this repairing task.)

二叉树的操作，涉及到三种顺序的遍历，树的凹入表示法，转化为一维数组储存，节点的计数，以及中序线索化。(Binary operation, involving three kinds of the order of traversal, tree concave representation into a one-dimensional array of storage, the node count, as well as in the threaded sequence.)

the ADT we have come up with is a well known ADT called a stack, which is defined by our four operations