资源列表
array
- 动态二维数组，实现数组的动态构造，运行时分配，C语言实现-Dynamic two-dimensional array, to achieve a dynamic array structure, run-time distribution, C language
migong
- 迷宫算法的递归实现，便于初学者理解回溯哦思想-Maze algorithm recursive implementation, easy for beginners to understand the thinking back Oh
N-QUENE
- 算法在前N/2个位置，利用随机算法求解，得到一个可能的排列之后，利用回溯法求解后面的布局，-Algorithm is the first N/2 positions, using a random algorithm to get a possible arrangement, the use of backtracking to solve the back of the layout,
LV-backtrack01PACKING
- 给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包容量为c。问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大。在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。因此，该问题称为0-1背包问题。-Given n types of items and a backpack. Item i is the weight wi, the value of vi, backpack capacity of c.
bittree
- 树的遍历，包括树的前序遍历后序遍历中序遍历的递归和非递归算法。-Tree traversal, including the pre-order traversal of the tree in order traversal post-order traversal non-recursive and recursive algorithms.
car1
- 实现停车场系统的管理，能对不同的车辆进来时间，出去时间进行记录，然后算出停车需要的钱-Implement parking management system, vehicles can come in different time, out of time to record, and then calculate the money needed parking
msort
- 对一个数组实现归并排序，能够快速的实现多个数据的排序-Array implementation of a merge sort, to quickly sort multiple data
quicksort
- 一种对多个数据的排序方法，快速排序 。能够根据一个关键值对数据进行递归排序-A kind of multiple methods of data sorting, quick sorting. According to a critical value can be recursively sort the data
tree
- 二叉树的遍历，能够进行前序，中序和后序的排列。-Binary tree traversal, can be pre-order, the order and arrangement of the order
package
- 数据结构和算法分析的相关内容，这里是0/1背包问题的相关代码，将有助于你更好的学习相关内容。-Data structures and algorithm analysis of relevant content, here is the 0/1 knapsack problem related to code, will help you better learn the relevant content.
BplusT
- 实现B+ 树的查找、插入和删除的功能，自动建立B+树，并可以对属性进行索引-Implement the B+ tree search, insert and delete functions, automatically create B+ trees, and can be indexed on the properties
vc-semple
- 美河提供.C.编程.数据结构与程序设计方法-River to provide the United States. C. Programming Data Structures and Program Design