ADO MD 程序员参考手册 书籍语言： 简体中文 书籍类型： 程序设计 授权方式： 免费软件 书籍大小：...

本人上传的是用贪心算法实现找零钱问题。贪婪算法的根本思想是逐步获得最优解。-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.

Java写的TDS协议(JDBC/ODBC)实现-Java to write the TDS protocol (JDBC/ODBC) to achieve

这个源程序是关于无向图的邻接表生成和显示的，可以用这个程序实现-the source of the undirected graph generation and adjacent table shows, this procedure can be used to achieve

数据库设计基础 供数据库初学者参考 比较好的资料-Database design based on reference for database beginners relatively good information

迷宫算法（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.

数据结构关于多项式相加的源码-the soundcode of data-structure on the additon of the polynomals.

一个程序而已，不过看看也有好处-a procedure adopted, but it is also good to see

fastreport演示程序。fastreport是vcl库的下的一个报表三方控件，写的比delphi自带的报表系统好的多。(DELPHI中有bug）可以下载-FastReport demonstration program. FastReport VCL library is under a tripartite statement Control and writing than delphi"s own statements over a good system. (Delphi is bug) can be downloaded to s

一元多项式的计算,建立两个多项式，并进行相加，相减运算，输出结果.参考资料：严蔚敏《数据结构与算法》-one yuan polynomial calculations, the establishment of two polynomials, and together, subtract operation, the output results. References : Yan Wei Min "data structure and algorithm"

64位以内Rabin-Miller 强伪素数测试和Pollard rho 因数分解算法的实现-64 within Rabin-Miller-puppet prime testing and Pollard rho factorization algorithm implementation