/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means...

线性非线性 插值程序 用来求出 插值函数的 点具体如内容所属-Linear interpolation procedure used to derive non-linear interpolation function, such as the specific content of their

一个很叨 的算法作业,很强大的源代码 很强大的源代码很强大的源代码-A very garrulous operation of the algorithm, it is a powerful source code is a powerful source code is a powerful source code

数据结构课程实验之一，关于汉诺塔的问题，简单的小程序-Experimental data structure, one of course, on the Tower of Hanoi problem, a simple applet

该程序能实现的功能，若活动图有回路则无法计算出关键路径，即解决了判断工程的可行性问题。通过对工程活动的输入，可以建立任意的AOE网进行判断。对于输入的网，可以计算出每个活动的最早开始时间，最迟开始时间和全工程可以完成的最早时间，并找出关键路径和关键活动。-the program can achieve the functional, if a circuit map activities can not be calculated critical path, that is a judgment to resolve the feasibility of the project. Right through the importation of construction activities, we can establish arbitrary judgment AOE network. The network for the importation can be calculated for each of the earliest start time, the latest starting time and the entire project will be completed in the first time, and identify key and critical path activities.

long bei ge suan fa 龙算法-long bei ge suan fa Long algorithm

快速排序 基本思想：通过一趟排序，将待排序记录分割成独立的两部分，其中一部分记录的关键字均比另一部分记录的关键字小，则可分别对这两部分记录进行排序，以达到整个序列有序-Basic idea of quicksort: sort through the trip, will be to sort records is separated into two independent parts, some of which are recorded in another part of the record than keyword keyword small, then the two were part of the record sort, so as to achieve the entire sequence of orderly

约瑟夫问题有原始的约瑟夫和发展了的约瑟夫两种。 原始的约瑟夫的描述： 古代某法官要判决N个犯人的死刑，他有一条荒唐的法律，将犯人站成一个圆圈，从第S个人开始数起，每数到第D个犯人，就拉出来处决，然后再数D个，数到的人再处决―――直到剩下的最后一个可赦免。 发展的约瑟夫的描述： 古代某法官要判决N个犯人的死刑，但这N个人每人持有一个密码，他有一条荒唐的法律，将犯人站成一个圆圈，法官先给出一个密码M，从第S个人开始数起，每数到第M个犯人，就拉出来处决，再根据这个人所持有的密码F，然后再数F个，数到的人再处决，以此类推―――直到剩下的最后一个可赦免。-Joseph problems have original development of the Joseph and Joseph two. The original Joseph Description : Ancient a judge to sentence N inmates of the death penalty, he is a ridiculous law, prisoners station into a circle, from S began a few individuals, every few months to D prisoners, pull out executions, then D, the number of people to be re-executed--- until the last one left to be pardoned. The development of the Joseph Description : Ancient a judge to sentence N inmates of the death penalty, but each individual N holders a password, he is a ridiculous law, prisoners station into a circle, the judges first gave a password M, S individuals from the beginning of several, each of the first few inmates M , pull hi

这是数据结构课程设计的4个原程序代码分别是数据结构课程设计――猴子选大王问题数据结构课程设计-This the data structure of curriculum design four original code was designed data structure courses-- monkeys elected king issues of curriculum design data structure

一些常用的几何算法的C++实现,包括两点确定一条直线,两点间距离,点直线距离, 海伦公式求三角形面积,判断直线相交等-some common geometric algorithm C achieved, including two identified a straight line, the distance between two points, point straight distance Helen formula for triangle area, as judged straight intersection

数据库SQL语句应用大全-SQL database application Daquan