电话计费管理系统 尽量不要让站长把时间都花费在为您修正说明...

这是一个用面向对象方法实现多项式四则运算的源程序，算法高效，用到很多数据结构。压缩包里面只是源程序文件，在vc中运行。-This is an object-oriented method polynomial four Operational source, efficient algorithm that uses a lot of data structure. Compressed only source files inside the vc run.

题目:稀疏矩阵是指那些多数元素为0的矩阵.利用稀疏特点进行存储和计算可以大大节省存储空间,提高计算效率.实现一个能进行稀疏矩阵基本运算的运算器.基本要求:以带行逻辑连接信息的3元组顺序表表示稀疏矩阵,实现两个矩阵相加,相减和相乘的运算.矩阵的输入形式采用3元组表示,而运算结果的矩阵则以通常的阵列形式列出.概要设计:1.以带行逻辑连接信息的3元组顺序表表示稀疏矩阵2.本程序包含2个模块:(1) 各集合定义模块(2) 主程序模块-topics : sparse matrix refers to those elements for most of the matrix 0. Using sparse features storage and computation can be greatly reduced storage space and improve computational efficiency. One can achieve for sparse matrix operations basic computing device. Basic requirements : OK logical connection with the three yuan Information Group the order said the sparse matrix table to achieve two matrices together, subtract and multiply arithmetic. Matrix entry forms using three yuan Group said, and the results of the matrix operations while the usual array listed. summary of design : 1. in line with the logic of information linking the three element group said sparse chronology matrix 2. this program contains two modules : (1) Set module (2) main program module

[问题描述] 将N个关键字去整数的记录进行整序， 以使所有关键字为非负数的记录排在关键字为负数的记录之前，要求使用最少的附加空间，且算法的时间复杂度为O（N） [输入] 待排序记录个数，各关键字的值。 [输出] 关键字从正负分开，正数在前 [存储结构] 待排序记录顺序存储。 [算法的基本思想] 快速排序算法每次任取一个记录的关键字为标准，将其余记录分为两组将，N个关键字去整数的记录进行整序， 以使所有关键字为非负数的记录排在关键字为负数的记录之前。 #include using namespace std #define MAXNUM 100//设文件的最长可能长度 void sort(int* keys, const int len)//排序 -[Problem Description] N keyword to the integer sequence the entire record. keyword so that all non-negative Records with the keyword for the negative record, at least require the use of the additional space and time complexity of the algorithm is O (N) [imported] to be sort record number, The value of the keyword. [Output] keyword separate from the pluses and minuses are several former [storage structure] scheduling records to be stored sequence. [Algorithm for the basic idea] quick sort algorithm each time a record for any keyword as a standard, The remaining records will be divided into two groups, N-keyword

课程设计 课程设计 课程设计 课程设计 课程设计-CurriculumCurriculumCurriculumCurriculumCurriculumCurriculumCurriculumCurriculumCurriculum

ACM模拟试题 火星人 附件中有详细的题目要求和运行通过的源代码 -ACM mock examination papers Martian in detail the subject of the annex to the requirements and run through the source code

kruscal的源代码，实现最小生成树的算法，这个是本人自己编的小程序。-kruscal the source code to achieve the minimum spanning tree algorithm, this is my own small part of the process.

这是用java实现的一个人员管理系统的例子，可以实现人员管理-This is a java implementation of the personnel management system, examples of personnel management can be achieved

一个关于供求陪送的线路程序。里面用到了最短路径的知识，给初学者参考-one of the lines of supply and demand escort procedures. They use the shortest path of knowledge, reference to beginners

[问题描述] 在二叉排序树中查找关键字为KEY的记录 [输入] 有序表输入要查找元素的关键字 [输出] 查找成功是即可显示查找成功 #include #include typedef int KeyType typedef struct{ -[Problem Description] Binary Tree ranking keyword search for the records KEY [imported] ordered to investigate the importation of table find elements of the keyword search [output] is successful you can show success# include

迷宫求解问题。程序中已经建好了一个数组作为迷宫数组。然后进行试探，输出迷宫从起点到终点的路径。-Maze solving the problem. The program has been built as a maze of an array of arrays. And then test the output from the beginning to the end of the maze path.