01 knapsack problem to achieve the most simple, can do more in its expansion, I...

约瑟夫环的问题.采用循环链表来解决...简单-Joseph Ring issue. ... Using circular linked list to solve a simple ....

西电的VC++课上的几个通用模板,完全是可用的-West electricity VC++ Class several generic template is completely available

51aspx源码必读.txt   dianyingyuan.sln   ............AbouForm.cs   ............AbouForm.Designer.cs   ............AbouForm.resx   ............inDebugone.jpg   ....................dianyingyuan.exe   ....................dianyingyuan.pdb   ....................dianyingyuan.vshost.exe   ....................gongfu.jpg   ....................lost10-001-3.txt   ....................lost10-001-4.txt   ....................lost10-001-5.txt   ....................lost12-001-4.txt   ....................lost8-001-3.txt   ....................lost8-001-4.txt   ....................Sava.txt   ....................ShowList.xml   ....................spiderman3.jpg

索引顺序表查找,索引顺序查找即分块查找，是将顺序表分成诺干块。-Indexed sequential table lookup, the index in order to find that the search block is to the order of the table is divided into Nokan blocks.

算法类，合并排序的源代码，来自算法导论上的-Algorithm category, the combined ranking of the source code, from the Introduction to Algorithms

简单的access应用程序-simple access applications

二叉树的遍历方式，包括先序遍历 层序遍历，最后用凹入表示法表示出来，对初学数据结构的孩子很有帮助，使用文本文档写的，复制粘贴就可以用。

c#数据库连接及热图渲染矩阵计算，利用oracle数库连接读入数据，插入数据，利用线性差值及argis二次开发 插入热点，并将结果插入结果矩阵中

迷宫问题。以一个 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)