OracleDatabase10g实用培训教程

对N皇后问题进行优化，可以在较短时间内计算出皇后排列方法的个数-Optimized for N queens problem, you can calculate the Queen in a relatively short period of time means the number of ordered

停车场管理系统2（数据结构实习报告）-car park management system 2 (data structure internship report)

书中共介绍了四类排序函数：插入排序、起泡排序、选择排序、快速排序。我们需要建立一个无序随机序列，分别用上述排序方法对建立的无序序列有序化，编写相应的程序计算每种算法的赋值次数、比较次数以及所用时间，以此为依据来判断各种算法的效率。-introduced a total of four ranking functions : insertion sort, bubble sort, select, in order of Quick Sort. We need to build a disorderly random sequence, the use of such methods of sequencing to establish an orderly sequence of the disorder, and the preparation of the corresponding procedures of each algorithm for the calculation of frequency assignment, as well as comparison with the number of time, using this as the basis to judge the efficiency of algorithms.

此函数功能是图的遍历算法，用邻接矩阵存储图，然后求出其拓扑排序，再输出其图的信息-Function is to map the function of the traversal algorithm, the adjacency matrix storage map, then calculated the topological sort, then the output of its map information

同学通讯录系统,利用MFC编写,利用了数据库的技术-classmates directory system, using MFC preparation, the use of database technology

这是一个迷你的 java 项目是很容易理解和看起来对学生很有吸引力。在此文件中还包括项目报告和概要。希望它将帮助您最好的运气

平分算法来查找任何方程的多个根元素。它以输入的任何命令的多项式，给你的多项式的全部根。

Its about data structure Tr-Its about data structure Tree

学校景点分布图最佳路径选择，通过最短路径选择让游者能够自由选择最佳观赏路径-schools attractions distribution choose the best path through the shortest path chosen You can watch free to choose the best path

xbcnv提示：你将获得积分（0-20）的基础上，你的产品质量