包含冒泡排序算法函数模板和数据结构中的字符串查找例子及解线性方程组的3个典型算法加演示。...

Generating next numbers in SQLServer should not be a problem. But problems arise when a customer asks for different types of next numbers that you cannot generate directly from SQL Server. This brief article describes how you would tackle this problem in different scenarios.

力控组态软件和extremedb实时数据库接口-ForceControl configuration software and real-time database interface eXtremeDB

里边实现对人员信息的管理与包括电话号码，姓名，与其关系等信息，可以添加，删除，同时提供多种方法进行查询，比如电话号码，姓名等方式进行查询。

c语言编写，利用六种方法进行排序运算，以此对比各种排序方法的特点，包含源程序和课程设计报告。-c language using the six methods of sorting operations, thus comparing the characteristics of a variety of sorting methods, including source code and curriculum design report.

遍历是二叉树经常要遇到的一种操作.可以运用到二叉树结点计数,线索化二叉树,求二叉树的深度,表达式求值等算法中.在遍历的过程中,对结点的访问具有普遍的含义,可以是输出各结点的数据域信息,也可以是对结点作其他处理.另外,通过一次完整的遍历,可使二叉树中结点信息由非线性排列变为某种意义上的线性排列.也就是说,遍历操作使非线性结构线性化. -traverse binary tree is frequently encountered in a operation. Binary Tree can be applied to node count, clues of a binary tree, the binary tree for depth, in the expression evaluates such algorithm. the ergodic process, right node of the visit is universal meaning, it can be output in each node of data domain information, also be on the node for other treatment. Besides, a complete traversal, Binary enables information from the node into a nonlinear with a sense of linear order. In other words, Traversing operation nonlinear structure so linear.

用C语言编写的谭号强课后习题的部分解答，较参考书上使用，简单，易于理解，非常适合初学者。-err

n!不为0的最后一位，可以输出千万级别的阶乘最后一位-n! not the last one is 0, you can output level factorial million last

在有向图中计算最小生成树---Edmonds s Algorithm-Directed graph in calculating minimum spanning tree--- Edmonds s Algorithm

asp人事管理系统，可以用于毕业设计。供大家学习-asp Personnel Management System, can be used for graduation design. For them to learn from

对系统随机生成的一组数据进行排序，查找，统计不同排序方法需要的比较次数和交换次数以及不同排序需要的时间，还有要记录查找时间-The system randomly generates a set of data to sort, search, statistical comparison of the different sorting methods require the number and frequency of exchange, as well as the time required for the different sort, as well as to find time to record