资源列表
poj1990
- poj上第1990题目源码，用到了2个树状数组，这题数据结构是关键，想到了题目就很简单了-poj first topic FOSS 1990, used the two tree arrays, which that data structure is the key, think of a very simple topic
BiQuanSuanFa
- 避圈算法演示程序，实现了寻找最小生成树算法-avoid the circle algorithm demonstration procedures, the search for the minimum spanning tree algorithm
PaiDuiLiLun
- 实现了排队理论在数学中的使用方法，是一种图形化的演示，可以加深理解-realized the queuing theory in the use of mathematical methods, is a graphic demonstration, it can deepen understanding
queue8
- 八皇问题，是数据结构中一种典型的问题，一般采用回溯算法来解决，是一种经典的算法-eight Huang, data structure is a typical problem, generally use backtracking algorithm to solve them. is a classical algorithm
loki89loki91
- LOKI89、LOKI91加密解密算法。密码学应用-LOKI89, LOKI91 encryption and decryption algorithms. Cryptography Application
compositor_arithmetic
- 最近对排序算法的复习，包括直接插入排序，冒泡排序，选择排序，快速排序，归并排序，希尔排序。在VC6.0中测试通过并有简单原理说明-recent review of the sorting algorithms, including direct insertion sort, bubble sort, select Sort, quick sort, merge sort, Sort Hill. VC6.0 test in the adoption and simple Rationale
dependency
- This is a little tool to generate dependency and it is aimed to achieve BCD-normal form in relational database.-This is a little tool to generate dependenc y and it is aimed to achieve BCD - normal form in're lational database.
revmatrix
- 螺旋矩阵问题：编程产生H*L的螺旋矩阵。首先，我们用一个二维数组来放置矩阵，然后按照数字大小顺序来填充矩阵.-spiral Matrix : Programming produced H * L spiral matrix. First, we used a two-dimensional array to accommodate matrix, in accordance with the order number to filling matrix.
closed_point
- 在一维空间上，有N个点，使用递归算法求解两个点x1和x2，使得这两个点靠得最近。-in one-dimensional space, a point N, the use of recursive algorithm for two points x1 and x2, This makes two points on a recently.
matrix_mult
- 矩阵链的相乘的源代码，采用动态归还算法求解得到最优解。-chain matrix multiplication of the source code, the return of dynamic algorithm to obtain the optimal solution.
8_puzzle
- 8_puzzle问题，初始状态下8个方块随机排列。编程序排列1～8方块的顺序，使得位于3*3的网格中，并且8个方块处于正确的位置。-8_puzzle problem, the initial state of eight box random order. Programmed with a box-8 in the order, made at the 3 * 3 grid, and eight box at the right place.
erchashu111
- 该程序是我的实验作业，二叉树中两结点最近的共同祖先-the procedure is experimental operation, the two binary tree node recent common ancestor