一类计算器的初步研究，一类考试系统的结晶…

SVG动态读取数据库并实时显示出来。该代码以通过后台读取时间实时显示出来，如果你需要读取数据库，请在Default.aspx中处理即可。-SVG Dynamic read the database and displayed in real time. The code to read through the background of real-time display of time, if you need to read the database, please Default.aspx in treatment can be.

约瑟夫环实现

使用堆栈完成火车车厢重排的算法，是一个小的算法，主要在于学习堆栈的应用。-use stack train compartments complete rearrangement of the algorithm, is a small algorithm, mainly studying the application stack.

最小二乘逼近（least-squares approximation）得到一组离散（discrete）数据点的近似函数（approximating function），实验数据往往是用最小二乘逼近得到一条秘密曲线（curve fitting）。下面概述的是最小二乘近似作为多项式的近似函数，除了多项式外，指数的几个右公式也可以作为类似的函数使用。关于最小平方近似的计算原理，请参考市场上的数值分析书籍

典型的迷宫算法，用数据结构――栈来实现，很好的代码-maze

自动从数据库按类导出文本，读取ACCESS，根据文本类别 读出文本-Automatically derived from the database by category text, read ACCESS, according to the text read out the text of the categories

数据库课程设计工程项目管理系统 仅供参考-curriculum design database management system project is for reference only

可以进行简单的S型座位编排！这是一个数据库应用的小程序，可以继续扩展其功能-can conduct a simple S-type seating arrangements! This is a small database application procedures, can continue to expand its functions

1，图的建立与遍历操作 建立图的邻接矩阵 输出图从顶点V0出发按深度优先遍历的顶点序列 输出图从顶点V0出发按广度优先遍历的顶点序列 2，图的建立与拓扑排序-1, Graph traversal operation with the establishment of the establishment of the adjacency matrix output plans starting from the vertex V0 by depth-first traversal sequence of vertices losers Figure out from the starting point V0 according to the breadth- first traversal sequence vertex 2, and plans to establish the topological sorting

这个简单的程序写的是几种不同的对二叉树的遍历算法，在数据结构中经常可以看到。-This simple procedure is to write several different types of the traversal algorithm for binary tree in data structure can be seen frequently.