关于货箱装船问题的贪婪算法，只是简要描述

迷宫问题。以一个 m*n的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论 起点就是方阵中的（1，1）终点就是（m-1，n-1） -Maze. With an m* n matrix, said the long labyrinth of 0 and 1, respectively, the maze of paths and obstacles. Designing a program, for any set of the maze, find a path from the entrance to the export, or come to the conclusion there is no access point is a square matrix of the (1,1) The end is (m-1, n-1)

资源描述数据结构第三章课后题二叉树，对于初学数据结构有很大的帮助

mapreduce的工具软件。来源为ibm 的技术论坛。-mapreduce software tools. Source for ibm technical forum.

这是俺编写的一个堆栈，采用模版函数编写，面向过程设计，供大家参考-I prepared a stack, using templates prepared function, process-oriented design, for your reference

数据结构经典算法，c源码，很齐全的，对学习数据结构很有帮助。-c program，

数据结构中实现图的关键路径的算法，是在TC中运行的。-data structure to achieve the critical path map algorithm is run in the TC.

学习指针的一个好例子，新手必下！绝对好用！高手还是不要下的好！-learning targets of a good example, and newcomers will under! Absolutely handy! Experts still do not have a good!

共有4个数据结构的实例-a total of four examples of the data structure

问题描述： 给定n个石子，其重量分别a1,a2,a3...an,要求将其划分成m份，每一份的划分费 义为这份石了中最大重量与最小重量的差的平方。总划分费用等丁m份划分费用之和。 编程任务 对于给定的n个石子，求一种划分方案，使得总划分费用最小。-Description of the problem: Given n-stones, its weight, respectively a1, a2, a3 ... an, asked that it be divided into m copies, each of the division of costs defined as the weight of the stone of the largest and the smallest weight difference the square. Small m the total costs were divided into the sum of the cost. Programming tasks for a given n-stones, seek a kind of division, making the total cost of the smallest division.

用VC加ADO操作ACCESS数据库，很好的例子！采用文档视图界面，其中CListcTrl控件应用于数据的显示上，方法灵活恰当，很值得一看。-increase ADO VC operation ACCESS database, a good example! Using documents View interface, which controls applied CListcTrl data showed that the methods appropriate, it is worth looking at.