一个简单的数据库管理系统,是用delphi开发的.

基于神经网络实现的JAVA代码，BP前缀型，使用简单。分为三个包，一个layer层，一个节点NODE 一个网络NETWORK。 基于神经网络实现的JAVA代码，BP前缀型，使用简单。分为三个包，一个layer层，一个节点NODE 一个网络NETWORK

数据结构的运算方法-data structure computing methods

图书馆管理系统,功能有对图书进行管理，人员管理，用户管理，借还书管理，信用情况管理等-library management system, a function of library management, personnel management, user management, through book management, credit management, etc.

本程序是以图形化，慢动作显示经典棋盘覆盖算法问题。-This procedure is based on graphical, slow-motion show the classic board covering algorithm problem.

数据结构算法，图最短路径-data structure algorithm, the shortest path map

可实现矩阵转换，螺旋数组，数字移动，数组操作，桶排序，杨辉三角形-conversion matrix can be realized, helical array, digital mobile array operation, barrels, in order of Yang Hui triangle

本书是作者编程经验的结晶，由发表在杂志上的专栏文章构成，每一章内容相对独立，但都是编程过程中的有机组成部分。本书内容包括问题定义、算法、数据结构、程序验证与测试、程序优化与效率问题，以及这些技巧在排序、查找和字符串处理等方面的几个实际应用。本书每章末尾都附带有相关内容的问题，附录中给出了一些问题的提示和解答。仔细思考问题或与同事进行讨论，可以巩固所学知识，将作者的经验应用到自己的编程实践中。-This book is the author of the crystallization of programming experience, published in the journal by the column consists of the contents of each chapter is relatively independent, but they are in the process of programming an integral part. The book includes problem definition, algorithms, data structures, program verification and testing, process optimization and efficiency issues, as well as these skills in sorting, string search and deal with several aspects of practical application. The book comes at the end of each chapter has relevant content issues, the appendix gives some tips and answers to the problem. Think carefully about questions or discussion with colleagues, you can consolidate the knowledge acquired will be applied to the author

1、 字符串由随机产生的1~16位的字母组成，然后用插入排序、冒泡排序、堆排序、快速排序、归并排序对字符串进行排序。-1, the string randomly generated by the 1 ~ 16 of the letters, and then use Insertion Sort, Bubble Sort, Heap Sort, Quick sort, merge sort to sort on the string.

Data Replication Prototype Using ADO

labyrinth: you need to find the doable way to go to the destinaton.And then print out the path.-labyrinth: You need to find the doable way to go to the destinaton.And then print out the path.