DELPHI+ACCESS 客户关系管理

本程序由C++实现内存管理，主要有新建进程和结束进程两个功能，这两个功能又通过链表的基本操作来完成，增加、删除结点，还有排序。

“数据结构、算法和程序”这个抽象世界的特殊旅程，以解决现实生活中的许多难题- Data structures, algorithms and procedures of the abstract world of a special journey to solve many real-life problems

顺序表的基本操作-order the basic operation

本人上传的是用贪心算法实现找零钱问题。贪婪算法的根本思想是逐步获得最优解。-I uploaded is to use greedy algorithm to find small change problem. Greedy algorithm is the fundamental idea is to gradually get the optimal solution.

Prim 算法寻找最小生成树，用C语言实现，有完整的注释！-Prim algorithm to find the minimum spanning tree, using C language, a complete Notes!

这是同学信息资料管理系统的设计，包括设计说明！-This is a classmates information manager design including design specification.

NetBeans下的 Java访问数据库的工程文件。-NetBeans under the Java access to the database project file.

一个解码的类，常用在条形码的解码中，是老外写的比较实用-a decoder category, commonly used in bar code decoding, the foreigner is more practical writing

线性代数中的矩阵求逆的问题，使用此算法可以简化矩阵的操作。-linear algebra of matrix inversion, the use of this algorithm can be simplified matrix operation.

迷宫算法（maze） /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination. */ -/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination.