Data structure of the source code and supporting notes, very complete, very usef...

这是数据结构中约瑟夫环问题！-This is the data structure Josephus problem!

数据库的代码 数据库 的代码 数据库的代码 -Database code database source code database

java 数据库 功能强大 效率高 SmallSQL Database is a free DBMS library for the Java(tm) platform. It runs on the Java 2 Platform (JDK 1.4 or later) and implements the JDBC 3.0 API. SmallSQL Database is licensed under the terms of the GNU Lesser General Public Licence (LGPL). A copy of the licence is included in the distribution. Please note that SmallSQL Database is distributed WITHOUT ANY WARRANTY without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. Please refer to the licence for details.-java a powerful and efficient database SmallSQL Database is a free DBMS library for the Java (tm) platform. It runs on the Java 2 Platform (JDK 1.4 or later) and implements the JDBC 3.0 API.SmallSQL Database is licensed under the terms of the GNU Lesser GeneralPublic Licence (LGPL). A copy of the licence is included in thedistribution.Please note that SmallSQL Database is distributed WITHOUT ANY WARRANTY without even the implied warranty of MERCHANTAB

本程序用另外一种算法即近邻算法解决ＴＳＰ，即旅行商问题，请高手指教．-this procedure with the other algorithms that solve the TSP neighbor algorithm, the traveling salesman problem, experts advise.

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

哈夫曼算法的源程序，根据清华大学数据结构一书中的算法编写-Huffman algorithm source code, according to a data structure of Qinghua University"s book algorithm

1、 用随机数生成的方式（要求用户输入随机数）产生一个迷宫：“1”表示墙，“0”表示路，最后的路径用“8”表示，若没有路径则打印报文，若有路径则打印出路径。 2、 通过堆栈及判断实现迷宫的自动寻找路径功能 -1, the random number generator of (requiring user input random number) produces a maze : "a" Wall said, "0" Lu said, the final path with "8" that if no path was reportedly Print text, if it were printed out trails path. 2, stack and judgment to achieve the labyrinth path function to automatically search

fish算法,模式识别-fish algorithm, pattern recognition

这里有一些数据结构中的通用算法，拿出来和大家共享了◎-Here are some of the generic data structure algorithms, up to and everyone shared ◎

问题描述： 给定n个石子，其重量分别a1,a2,a3...an,要求将其划分成m份，每一份的划分费 义为这份石了中最大重量与最小重量的差的平方。总划分费用等丁m份划分费用之和。 编程任务 对于给定的n个石子，求一种划分方案，使得总划分费用最小。-Description of the problem: Given n-stones, its weight, respectively a1, a2, a3 ... an, asked that it be divided into m copies, each of the division of costs defined as the weight of the stone of the largest and the smallest weight difference the square. Small m the total costs were divided into the sum of the cost. Programming tasks for a given n-stones, seek a kind of division, making the total cost of the smallest division.