DentalPayment

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

Ora10GSQLReference oracle10gSQL语言参考-Ora10GSQLReference

pb实现的气泡窗口，非常实用-pb achieve the bubble window, a very practical

Matlab应用篇提供了大量的Matlab应用实例。配合前三篇所讲内容，巩固Matlab知识。-Matlab Application chapter provides a large number of application examples Matlab. Compatible with the three have said, the consolidation of Matlab knowledge.

用C语言实现动态表的源程序，包括各种必须的方法-C language movements of the source, including all necessary means

本演示程序演算约瑟夫环问题，人数n应为任意的，首先应输入一个值赋给初始报数上限m，程序应能自动保存出列人的序号和将出列的人所持的密码赋给m，再次作为报数上限，如此循环，直至所有人都出列为止。-The demo program Joseph Central calculus problem, the number n should be arbitrary, we must first enter a value assigned to the initial reported that the maximum number of m, the procedure should be able to automatically save a list of the serial number of people and held out the password given to m, again as reported maximum number of such cycles, until all that far out.

一元多项式相加程序，用于完成一元多项式的相加-One of the polynomial sum of procedures used to complete the sum of the polynomial 1

此文件包含组成 calc24point 应用程序的每个文件的内容摘要。-calc24point application components of each document summary of the contents.

数据结构上让我们编写的排序算法，有冒泡，堆排序等-Data structure so that we prepared on sorting algorithms, there are bubble, heap sort, etc.

随机产生5组测试数据，分别进行顺序查找，折半查找和分块查找，输出比较结果-five groups randomly generated test data, for the order to search, locate and half-block search, the output results