资源列表
会议安排
- 本代码用贪心算法实现会议安排的最佳顺序，其目标是使得能够安排的会议数量最多，是贪心算法的典型应用-code with the greedy algorithm to achieve the best arrangements for the order, its goal is to arrange the largest number of meetings, the greedy algorithm is a typical application
kdtree
- Implementation of k-d tree(including insertion/deletion). Well suited for beginners in advanced Multi-dimensional datastructures and algorithms
LinkedLista
- 此为初步实现，简单直观，可在此基础上增强功能。-preliminary achieve this, simple, and the basis of this enhanced functionality.
队列
- 数据结构的运算方法-data structure computing methods
Matrix_Chain
- 求解矩阵链相乘的问题，通过动态规划的方法，来求解该问题，使得矩阵链的相乘的运算最少。-chain matrix multiplication to solve the problem through dynamic programming methods to solve the problem, making the chain matrix multiplication operator at least.
顺序表
- 顺序表
houzhui
- 中缀表达式转换为后缀表达式并求值 使用switch语句-Infix expression into a suffix for the value of expression and the use of switch statement
datastruct
- 有序表上二分查找,数据结构中的一种，C语言实现，学生专用-Ordered binary search form, a data structure, C language, for students
text_1_1
- 实现线性表的创建、删除、插入、遍历操作，方便大家使用-To achieve a linear form to create, delete, insert, traversal operation, easy to use you
1
- 数据结构中的顺序表，是其中的一个重要组成部分-The order of the table data structure is an important component of which
0-1hs
- 0-1背包问题-回溯法,算法设计课程作业-0-1 knapsack problem- Backtracking algorithm design course work
6-1solution
- 哥尼斯堡的“七桥问题”，哥尼斯堡是位于普罗格河上的一座城市，包含两个岛屿及连接他们的七座桥，问可否走出这样的七座桥，而且每桥只走一次-Konigsberg' s " Seven Bridges problem," Konigsberg is a city located on the river progreso, contains two islands and seven bridges connecting them, asking whether we could