migong

给定n种物品和一背包。物品i的重量是wi>0,价值为vi>0,背包的容量为c。选择装入背包的物品，使得装入背包中物品的总价值最大。(Given n kinds of goods and a backpack. Weight of the item i is wi> 0, the value of vi> 0, knapsack capacity c. Select the items into the backpack, so into the backpack of items in the total value of the maximum.)

X位赋0mintest是实现芯片功耗测试不确定位填充算法(X-bit chip is to achieve the power conferred 0mintest test uncertain bit stuffing algorithm)

队列的一般数据结构 队列的创建 删除 修改 取数据等等(The general data structure queue queue to take the data and so create delete modify)

利用二叉平衡树进行数据排序。这里采用的数据结构是指针。(The use of balanced binary tree sort the data. The data structure used here is a pointer.)

一个经典的旅行商问题源码，不是最优解，只是一种 思路(A classic traveling salesman problem source is not the optimal solution, just a thought)

通过冒泡排序法和选择排序法实现对若干数字的排序。(To achieve the order of several numbers)

用哈夫曼编码的方式进行图像的压缩，其中定义了一个cdib的类，通过之类来对图像进行处理(image coding in haffman)

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

二叉排序树的建立、插入与删除。按递增顺序插入N个整数，并按同样顺序删除；(Binary sort tree establishment, insertions and deletions. Insert N integers in ascending order, press the same sequence deleted )

实现冒泡，快速，希尔排序法。并计算，比较他的次数。(Achieve bubbling fast shell sort. And calculate, compare the number of times.)