学生成绩管理系统

这个程序是按照离散数学教材上给出的算法写的，是字典序的全排列算法。空间复杂度是O(n)，时间复杂度基本上是O(n^2)。缺点是只用于打印并没有储存所有的结果。-the procedure is in accordance with the materials on discrete mathematics algorithm is written, is a wholly-lexicographic order algorithm. Space complexity is O (n), is basically time complexity is O (n ^ 2). Only drawback is not for print, and store all the results.

一个数据结构的演示程序,包含顺序表,广义表,顺序查找等-A data structure of the demo program, including the order form, the generalized form, the order of search, etc.

零件切割问题： 给定一块宽度为W的矩形板，矩形板的高度不受限制。现需要从板上分别切割出n个高度为hi，宽度为wi的矩形零件。切割的规则是零件的高度方向与矩形板的高度方向保持一致。问如何切割使得所使用的矩形板的高度h最小？ 任给一个输入实例，能输出切割所需要的实际高度并能用图形演示切割的过程-cutting parts : a given width of the rectangular plate W, the height of rectangular plate unrestricted. Need from the board is cutting out respectively n height of the hi, wi width of the rectangular parts. Cutting parts to the rules of the height of the rectangular plate with a high degree of consistent direction. Asked how cutting makes use of the rectangular plate height h minimum? As an input for example, will cut output by the needs of the high and can be used graphic demonstration of the cutting proce

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

深度搜索算法，求解从起源点s到点j的最短路径算法的基本过程-depth search algorithm, solved from the point of origin j s close of the shortest path algorithm for the basic process

数据结构课程设计 B-树 等 希望对大家有帮助-Data Structure Course Design B-trees, etc. We want to help

用c写的数据结构链表的操作，包括关于链表的系列操作-used to write the data structure Chain operations, including a series of Chain Operation

求最近点对问题， 求最近点对问题。-Nearest point on the issue of demand, and the nearest point on the issue, and the nearest point on the issue.

多项式加减乘 用数据节够得算法实现多项式的加减乘 原理简单易懂-suoxiangshi jiajiancheng